./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-0cd3be1 [2018-11-28 13:22:35,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:22:35,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:22:35,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:22:35,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:22:35,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:22:35,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:22:35,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:22:35,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:22:35,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:22:35,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:22:35,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:22:35,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:22:35,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:22:35,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:22:35,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:22:35,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:22:35,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:22:35,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:22:35,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:22:35,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:22:35,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:22:35,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:22:35,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:22:35,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:22:35,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:22:35,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:22:35,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:22:35,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:22:35,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:22:35,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:22:35,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:22:35,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:22:35,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:22:35,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:22:35,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:22:35,633 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:22:35,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:22:35,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:22:35,641 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:22:35,642 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:22:35,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:22:35,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:22:35,642 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:22:35,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:22:35,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:22:35,643 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:22:35,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:22:35,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:22:35,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:22:35,643 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:22:35,644 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:22:35,644 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:22:35,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:22:35,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:22:35,644 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:22:35,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:22:35,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:22:35,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:22:35,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:22:35,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:22:35,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:22:35,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:22:35,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:22:35,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:22:35,646 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_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:35,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:22:35,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:22:35,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:22:35,681 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:22:35,681 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:22:35,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 13:22:35,717 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/data/70a552a1a/f3829f2afbbe48fea115a93f75779ff1/FLAG0ffeb8a19 [2018-11-28 13:22:36,164 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:22:36,165 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 13:22:36,172 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/data/70a552a1a/f3829f2afbbe48fea115a93f75779ff1/FLAG0ffeb8a19 [2018-11-28 13:22:36,182 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/data/70a552a1a/f3829f2afbbe48fea115a93f75779ff1 [2018-11-28 13:22:36,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:22:36,185 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:22:36,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:22:36,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:22:36,188 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:22:36,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2560d587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36, skipping insertion in model container [2018-11-28 13:22:36,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:22:36,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:22:36,423 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:22:36,481 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:22:36,516 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:22:36,550 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:22:36,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36 WrapperNode [2018-11-28 13:22:36,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:22:36,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:22:36,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:22:36,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:22:36,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... [2018-11-28 13:22:36,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:22:36,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:22:36,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:22:36,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:22:36,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:22:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:22:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 13:22:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 13:22:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-11-28 13:22:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-28 13:22:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-28 13:22:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-28 13:22:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-28 13:22:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-28 13:22:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:22:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 13:22:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 13:22:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 13:22:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:22:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:22:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:22:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:22:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:22:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:22:36,638 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:22:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:22:36,640 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:22:36,641 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:22:36,642 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:22:36,643 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:22:36,644 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-28 13:22:36,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:22:36,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:22:37,050 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:22:37,050 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 13:22:37,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:22:37 BoogieIcfgContainer [2018-11-28 13:22:37,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:22:37,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:22:37,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:22:37,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:22:37,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:22:36" (1/3) ... [2018-11-28 13:22:37,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c5e133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:22:37, skipping insertion in model container [2018-11-28 13:22:37,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:22:36" (2/3) ... [2018-11-28 13:22:37,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c5e133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:22:37, skipping insertion in model container [2018-11-28 13:22:37,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:22:37" (3/3) ... [2018-11-28 13:22:37,058 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-28 13:22:37,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:22:37,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-11-28 13:22:37,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-11-28 13:22:37,104 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:22:37,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:22:37,105 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:22:37,105 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:22:37,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:22:37,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:22:37,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:22:37,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:22:37,105 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:22:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-11-28 13:22:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 13:22:37,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:37,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:22:37,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:37,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482384, now seen corresponding path program 1 times [2018-11-28 13:22:37,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:37,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:37,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:37,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:22:37,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:22:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:22:37,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:22:37,260 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2018-11-28 13:22:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:37,370 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-11-28 13:22:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:22:37,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 13:22:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:37,378 INFO L225 Difference]: With dead ends: 106 [2018-11-28 13:22:37,379 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 13:22:37,380 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-11-28 13:22:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 13:22:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-28 13:22:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 13:22:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-28 13:22:37,410 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 12 [2018-11-28 13:22:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:37,411 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-28 13:22:37,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:22:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-11-28 13:22:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 13:22:37,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:37,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:22:37,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:37,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1843482383, now seen corresponding path program 1 times [2018-11-28 13:22:37,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:37,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:37,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:37,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:37,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:37,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:22:37,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:22:37,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:22:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:22:37,467 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 3 states. [2018-11-28 13:22:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:37,529 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-28 13:22:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:22:37,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-28 13:22:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:37,530 INFO L225 Difference]: With dead ends: 96 [2018-11-28 13:22:37,530 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 13:22:37,531 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-11-28 13:22:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 13:22:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 13:22:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:22:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-28 13:22:37,537 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2018-11-28 13:22:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:37,538 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 13:22:37,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:22:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-28 13:22:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 13:22:37,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:37,539 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-11-28 13:22:37,539 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:37,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash 92083562, now seen corresponding path program 1 times [2018-11-28 13:22:37,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:37,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:37,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:37,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:37,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:22:37,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:22:37,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:22:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:22:37,608 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 5 states. [2018-11-28 13:22:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:37,645 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-28 13:22:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:22:37,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 13:22:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:37,647 INFO L225 Difference]: With dead ends: 97 [2018-11-28 13:22:37,647 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 13:22:37,647 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-11-28 13:22:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 13:22:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-28 13:22:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 13:22:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-11-28 13:22:37,655 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 20 [2018-11-28 13:22:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:37,656 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-11-28 13:22:37,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:22:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-11-28 13:22:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:22:37,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:37,657 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-11-28 13:22:37,658 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:37,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash -612607148, now seen corresponding path program 1 times [2018-11-28 13:22:37,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:37,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:22:37,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:22:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:22:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:22:37,767 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-11-28 13:22:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:37,873 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-11-28 13:22:37,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:22:37,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-28 13:22:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:37,876 INFO L225 Difference]: With dead ends: 97 [2018-11-28 13:22:37,876 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 13:22:37,876 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-11-28 13:22:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 13:22:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-28 13:22:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:22:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-28 13:22:37,881 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 30 [2018-11-28 13:22:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:37,881 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-28 13:22:37,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:22:37,881 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-28 13:22:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:22:37,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:37,882 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-11-28 13:22:37,882 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:37,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash -612607149, now seen corresponding path program 1 times [2018-11-28 13:22:37,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:37,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:22:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:22:37,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:22:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:22:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:22:37,950 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 6 states. [2018-11-28 13:22:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:38,046 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-11-28 13:22:38,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:22:38,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-28 13:22:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:38,047 INFO L225 Difference]: With dead ends: 96 [2018-11-28 13:22:38,047 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 13:22:38,048 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-11-28 13:22:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 13:22:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-28 13:22:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 13:22:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-11-28 13:22:38,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 30 [2018-11-28 13:22:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:38,052 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-11-28 13:22:38,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:22:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-11-28 13:22:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:22:38,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:38,053 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-11-28 13:22:38,053 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:38,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -304950988, now seen corresponding path program 1 times [2018-11-28 13:22:38,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:38,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:38,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:38,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:38,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:38,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:38,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:39,589 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-11-28 13:22:39,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:39,593 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-11-28 13:22:39,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 13:22:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:39,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:39,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 13:22:39,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:22:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:22:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-11-28 13:22:39,630 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 12 states. [2018-11-28 13:22:39,942 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 13:22:40,294 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 13:22:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:40,608 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-11-28 13:22:40,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:22:40,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-28 13:22:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:40,610 INFO L225 Difference]: With dead ends: 132 [2018-11-28 13:22:40,610 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 13:22:40,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-11-28 13:22:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 13:22:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-11-28 13:22:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 13:22:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-11-28 13:22:40,617 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 32 [2018-11-28 13:22:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:40,618 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-11-28 13:22:40,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:22:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-28 13:22:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:22:40,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:40,620 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-11-28 13:22:40,620 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:40,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:40,620 INFO L82 PathProgramCache]: Analyzing trace with hash -304950987, now seen corresponding path program 1 times [2018-11-28 13:22:40,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:40,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:40,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:40,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:40,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:40,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:40,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:40,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:40,802 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-11-28 13:22:40,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:40,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:40,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 13:22:41,072 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-11-28 13:22:41,078 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-11-28 13:22:41,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:41,081 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-11-28 13:22:41,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-11-28 13:22:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-11-28 13:22:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-11-28 13:22:41,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:22:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:22:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-11-28 13:22:41,104 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 10 states. [2018-11-28 13:22:41,615 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-28 13:22:42,141 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-28 13:22:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:42,364 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-28 13:22:42,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:22:42,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-28 13:22:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:42,365 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:22:42,365 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 13:22:42,365 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-11-28 13:22:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 13:22:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-28 13:22:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 13:22:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-28 13:22:42,370 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-11-28 13:22:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:42,370 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-28 13:22:42,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:22:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-28 13:22:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 13:22:42,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:42,371 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-11-28 13:22:42,371 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:42,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash -999969269, now seen corresponding path program 1 times [2018-11-28 13:22:42,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:42,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:42,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:42,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:42,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:42,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:42,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:42,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2018-11-28 13:22:42,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:22:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:22:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:22:42,502 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 8 states. [2018-11-28 13:22:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:42,548 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-28 13:22:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:22:42,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-28 13:22:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:42,549 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:22:42,549 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 13:22:42,549 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-11-28 13:22:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 13:22:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-28 13:22:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 13:22:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-11-28 13:22:42,552 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2018-11-28 13:22:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:42,552 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-28 13:22:42,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:22:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-11-28 13:22:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:22:42,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:42,553 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-11-28 13:22:42,553 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:42,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash -939056962, now seen corresponding path program 1 times [2018-11-28 13:22:42,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:42,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:42,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:42,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:42,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:42,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:42,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:42,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 13:22:42,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:22:42,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:22:42,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:22:42,782 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 9 states. [2018-11-28 13:22:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:42,914 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-11-28 13:22:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:22:42,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-28 13:22:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:42,916 INFO L225 Difference]: With dead ends: 111 [2018-11-28 13:22:42,916 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 13:22:42,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:22:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 13:22:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-11-28 13:22:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 13:22:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-28 13:22:42,920 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 35 [2018-11-28 13:22:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:42,920 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-28 13:22:42,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:22:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-28 13:22:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:22:42,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:42,921 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-11-28 13:22:42,921 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:42,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -939056963, now seen corresponding path program 1 times [2018-11-28 13:22:42,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:42,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:42,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:42,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:42,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:22:42,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:42,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:42,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:43,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:22:43,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:43,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-28 13:22:43,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:22:43,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:22:43,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:22:43,058 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 5 states. [2018-11-28 13:22:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:43,124 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-11-28 13:22:43,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:22:43,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-28 13:22:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:43,125 INFO L225 Difference]: With dead ends: 104 [2018-11-28 13:22:43,126 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 13:22:43,126 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-11-28 13:22:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 13:22:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-11-28 13:22:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 13:22:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-11-28 13:22:43,128 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2018-11-28 13:22:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:43,129 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-11-28 13:22:43,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:22:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-11-28 13:22:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 13:22:43,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:43,130 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-11-28 13:22:43,130 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:43,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash 954005222, now seen corresponding path program 1 times [2018-11-28 13:22:43,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:43,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:22:43,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:43,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:22:43,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:22:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:22:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:22:43,183 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 7 states. [2018-11-28 13:22:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:43,318 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-28 13:22:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:22:43,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-28 13:22:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:43,319 INFO L225 Difference]: With dead ends: 103 [2018-11-28 13:22:43,319 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 13:22:43,319 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-11-28 13:22:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 13:22:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-28 13:22:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:22:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-28 13:22:43,322 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 36 [2018-11-28 13:22:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:43,326 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-28 13:22:43,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:22:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-28 13:22:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 13:22:43,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:43,327 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-11-28 13:22:43,327 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:43,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:43,327 INFO L82 PathProgramCache]: Analyzing trace with hash 954005223, now seen corresponding path program 1 times [2018-11-28 13:22:43,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:43,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:43,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:43,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:22:43,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:22:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:22:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:22:43,414 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-11-28 13:22:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:43,556 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-28 13:22:43,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:22:43,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-28 13:22:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:43,558 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:22:43,558 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 13:22:43,559 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-11-28 13:22:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 13:22:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-28 13:22:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 13:22:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-11-28 13:22:43,561 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 36 [2018-11-28 13:22:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:43,562 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-11-28 13:22:43,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:22:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-11-28 13:22:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:22:43,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:43,563 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-11-28 13:22:43,563 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:43,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash 208022194, now seen corresponding path program 1 times [2018-11-28 13:22:43,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:43,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:22:43,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:43,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:22:43,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:22:43,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:22:43,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:22:43,654 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 12 states. [2018-11-28 13:22:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:43,878 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-11-28 13:22:43,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:22:43,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-28 13:22:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:43,879 INFO L225 Difference]: With dead ends: 107 [2018-11-28 13:22:43,879 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 13:22:43,879 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-11-28 13:22:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 13:22:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-11-28 13:22:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:22:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2018-11-28 13:22:43,882 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 45 [2018-11-28 13:22:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:43,882 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2018-11-28 13:22:43,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:22:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2018-11-28 13:22:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:22:43,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:43,883 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-11-28 13:22:43,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:43,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 208022195, now seen corresponding path program 1 times [2018-11-28 13:22:43,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:44,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:44,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:22:44,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:22:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:22:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:22:44,022 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand 12 states. [2018-11-28 13:22:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:44,246 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-11-28 13:22:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:22:44,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-28 13:22:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:44,247 INFO L225 Difference]: With dead ends: 107 [2018-11-28 13:22:44,247 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 13:22:44,248 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-11-28 13:22:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 13:22:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-11-28 13:22:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 13:22:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-11-28 13:22:44,250 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2018-11-28 13:22:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:44,250 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-28 13:22:44,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:22:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-11-28 13:22:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:22:44,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:44,251 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-11-28 13:22:44,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:44,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1489686117, now seen corresponding path program 1 times [2018-11-28 13:22:44,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:44,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:44,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:44,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:22:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:44,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:22:44,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:22:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:22:44,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:22:44,335 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 12 states. [2018-11-28 13:22:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:44,581 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-11-28 13:22:44,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:22:44,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-28 13:22:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:44,582 INFO L225 Difference]: With dead ends: 121 [2018-11-28 13:22:44,582 INFO L226 Difference]: Without dead ends: 121 [2018-11-28 13:22:44,582 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-11-28 13:22:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-28 13:22:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-11-28 13:22:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 13:22:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-11-28 13:22:44,585 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 47 [2018-11-28 13:22:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:44,586 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-11-28 13:22:44,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:22:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-28 13:22:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:22:44,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:44,587 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-11-28 13:22:44,587 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:44,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1489686116, now seen corresponding path program 1 times [2018-11-28 13:22:44,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 13:22:44,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:44,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:22:44,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:22:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:22:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:22:44,629 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 4 states. [2018-11-28 13:22:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:44,647 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-28 13:22:44,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:22:44,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-28 13:22:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:44,649 INFO L225 Difference]: With dead ends: 114 [2018-11-28 13:22:44,649 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 13:22:44,649 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-11-28 13:22:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 13:22:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2018-11-28 13:22:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 13:22:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-11-28 13:22:44,652 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 47 [2018-11-28 13:22:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:44,652 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-11-28 13:22:44,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:22:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-11-28 13:22:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:22:44,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:44,653 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-11-28 13:22:44,653 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:44,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash 362970760, now seen corresponding path program 1 times [2018-11-28 13:22:44,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:44,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 13:22:44,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:44,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:22:44,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:22:44,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:22:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:22:44,680 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 6 states. [2018-11-28 13:22:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:44,704 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-11-28 13:22:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:22:44,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 13:22:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:44,705 INFO L225 Difference]: With dead ends: 96 [2018-11-28 13:22:44,705 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 13:22:44,705 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-11-28 13:22:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 13:22:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 13:22:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 13:22:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-11-28 13:22:44,708 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 47 [2018-11-28 13:22:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:44,708 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-11-28 13:22:44,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:22:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-11-28 13:22:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:22:44,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:44,709 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-11-28 13:22:44,709 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:44,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash -446967498, now seen corresponding path program 1 times [2018-11-28 13:22:44,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:44,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:44,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:44,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 13:22:44,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:44,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:22:44,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:22:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:22:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:22:44,749 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 5 states. [2018-11-28 13:22:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:44,771 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-11-28 13:22:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:22:44,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 13:22:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:44,772 INFO L225 Difference]: With dead ends: 107 [2018-11-28 13:22:44,772 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 13:22:44,773 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-11-28 13:22:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 13:22:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-11-28 13:22:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:22:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-11-28 13:22:44,775 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 48 [2018-11-28 13:22:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:44,776 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-11-28 13:22:44,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:22:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-11-28 13:22:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:22:44,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:44,776 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-11-28 13:22:44,777 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:44,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1606081466, now seen corresponding path program 1 times [2018-11-28 13:22:44,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:44,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 13:22:44,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:44,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:22:44,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:22:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:22:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:22:44,842 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2018-11-28 13:22:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:45,041 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-11-28 13:22:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:22:45,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-28 13:22:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:45,042 INFO L225 Difference]: With dead ends: 107 [2018-11-28 13:22:45,042 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 13:22:45,042 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-11-28 13:22:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 13:22:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-28 13:22:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 13:22:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-11-28 13:22:45,045 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 55 [2018-11-28 13:22:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:45,045 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-11-28 13:22:45,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:22:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-11-28 13:22:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:22:45,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:45,046 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-11-28 13:22:45,046 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:45,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1606081465, now seen corresponding path program 1 times [2018-11-28 13:22:45,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:45,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:45,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:45,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 13:22:45,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:45,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:45,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 13:22:45,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:45,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 13:22:45,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:22:45,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:22:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:22:45,175 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 7 states. [2018-11-28 13:22:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:45,212 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-11-28 13:22:45,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:22:45,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-28 13:22:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:45,214 INFO L225 Difference]: With dead ends: 118 [2018-11-28 13:22:45,214 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 13:22:45,214 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-11-28 13:22:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 13:22:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-11-28 13:22:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 13:22:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-11-28 13:22:45,217 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 55 [2018-11-28 13:22:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:45,217 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-11-28 13:22:45,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:22:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-11-28 13:22:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 13:22:45,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:45,218 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-11-28 13:22:45,219 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:22:45,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash 186975810, now seen corresponding path program 1 times [2018-11-28 13:22:45,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:45,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:45,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:22:45,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:22:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:45,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:22:45,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:45,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:45,748 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-11-28 13:22:45,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 13:22:45,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:22:45,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-28 13:22:45,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-28 13:22:45,840 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-11-28 13:22:45,842 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-11-28 13:22:45,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,853 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-11-28 13:22:45,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 13:22:45,929 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-11-28 13:22:45,932 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-11-28 13:22:45,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:45,943 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-11-28 13:22:45,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-11-28 13:22:47,988 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-28 13:22:47,993 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-11-28 13:22:47,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:47,996 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-11-28 13:22:47,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:48,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:48,006 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-11-28 13:22:48,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-11-28 13:22:48,154 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-11-28 13:22:48,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:48,164 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-11-28 13:22:48,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:22:48,171 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-11-28 13:22:48,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:48,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:22:48,177 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-11-28 13:22:48,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2018-11-28 13:22:57,245 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 13:22:57,254 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-11-28 13:22:57,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:57,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:57,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:57,267 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-11-28 13:22:57,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:57,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:57,282 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-11-28 13:22:57,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:51 [2018-11-28 13:22:57,404 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-11-28 13:22:57,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:22:57,406 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-11-28 13:22:57,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:57,411 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-11-28 13:22:57,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:22:57,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:57,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:22:57,415 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2018-11-28 13:22:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:22:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:22:57,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 43 [2018-11-28 13:22:57,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-28 13:22:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-28 13:22:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1765, Unknown=19, NotChecked=0, Total=1892 [2018-11-28 13:22:57,456 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 44 states. [2018-11-28 13:23:08,584 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-11-28 13:23:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:23:15,665 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-11-28 13:23:15,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 13:23:15,665 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 56 [2018-11-28 13:23:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:23:15,666 INFO L225 Difference]: With dead ends: 178 [2018-11-28 13:23:15,666 INFO L226 Difference]: Without dead ends: 178 [2018-11-28 13:23:15,667 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-11-28 13:23:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-28 13:23:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 127. [2018-11-28 13:23:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 13:23:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2018-11-28 13:23:15,671 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 56 [2018-11-28 13:23:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:23:15,671 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2018-11-28 13:23:15,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-28 13:23:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2018-11-28 13:23:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 13:23:15,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:23:15,672 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-11-28 13:23:15,672 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:23:15,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash 186975811, now seen corresponding path program 1 times [2018-11-28 13:23:15,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:15,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:16,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:23:16,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:23:16,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:16,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:23:16,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:16,541 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-11-28 13:23:16,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:16,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:16,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:23:16,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-11-28 13:23:16,629 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-11-28 13:23:16,631 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-11-28 13:23:16,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,647 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-11-28 13:23:16,648 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-11-28 13:23:16,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-11-28 13:23:16,706 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-11-28 13:23:16,709 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-11-28 13:23:16,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,732 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-11-28 13:23:16,735 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-11-28 13:23:16,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:72 [2018-11-28 13:23:16,858 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-11-28 13:23:16,861 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-11-28 13:23:16,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,889 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-11-28 13:23:16,892 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-11-28 13:23:16,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:110 [2018-11-28 13:23:16,971 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-11-28 13:23:16,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:16,974 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-11-28 13:23:16,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:16,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:17,019 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-11-28 13:23:17,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:17,023 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-11-28 13:23:17,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:17,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:17,048 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-11-28 13:23:17,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:169, output treesize:173 [2018-11-28 13:23:17,327 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-11-28 13:23:17,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:17,331 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-11-28 13:23:17,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:23:17,352 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-11-28 13:23:17,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:17,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:23:17,377 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-11-28 13:23:17,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:17,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-28 13:23:17,385 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:23:17,398 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-11-28 13:23:17,399 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:17,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:17,410 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-11-28 13:23:17,410 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:179, output treesize:21 [2018-11-28 13:23:34,460 WARN L180 SmtUtils]: Spent 754.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 13:23:34,473 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-11-28 13:23:34,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,481 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-11-28 13:23:34,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,532 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-11-28 13:23:34,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,539 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-11-28 13:23:34,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,573 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-11-28 13:23:34,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:228, output treesize:199 [2018-11-28 13:23:34,772 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-11-28 13:23:34,776 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-11-28 13:23:34,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,789 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-11-28 13:23:34,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,810 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-11-28 13:23:34,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, 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-11-28 13:23:34,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:23:34,821 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-11-28 13:23:34,821 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,830 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:23:34,835 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-11-28 13:23:34,835 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:187, output treesize:23 [2018-11-28 13:23:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 13:23:34,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:23:34,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2018-11-28 13:23:34,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-28 13:23:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-28 13:23:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2499, Unknown=16, NotChecked=0, Total=2652 [2018-11-28 13:23:34,952 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand 52 states. [2018-11-28 13:23:45,224 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 103 [2018-11-28 13:23:49,196 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-28 13:24:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:01,248 INFO L93 Difference]: Finished difference Result 256 states and 291 transitions. [2018-11-28 13:24:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 13:24:01,248 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 56 [2018-11-28 13:24:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:01,249 INFO L225 Difference]: With dead ends: 256 [2018-11-28 13:24:01,250 INFO L226 Difference]: Without dead ends: 256 [2018-11-28 13:24:01,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=436, Invalid=6026, Unknown=18, NotChecked=0, Total=6480 [2018-11-28 13:24:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-28 13:24:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 141. [2018-11-28 13:24:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-28 13:24:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2018-11-28 13:24:01,255 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 56 [2018-11-28 13:24:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:01,255 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2018-11-28 13:24:01,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-28 13:24:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2018-11-28 13:24:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:24:01,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:01,256 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-11-28 13:24:01,256 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:01,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash -374568026, now seen corresponding path program 2 times [2018-11-28 13:24:01,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:01,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 13:24:01,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:01,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:24:01,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:24:01,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:24:01,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 13:24:01,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:01,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 13:24:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:24:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:24:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:01,447 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand 7 states. [2018-11-28 13:24:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:01,553 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-11-28 13:24:01,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:24:01,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-28 13:24:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:01,555 INFO L225 Difference]: With dead ends: 122 [2018-11-28 13:24:01,555 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 13:24:01,555 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-11-28 13:24:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 13:24:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-28 13:24:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 13:24:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-11-28 13:24:01,559 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 59 [2018-11-28 13:24:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:01,559 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-11-28 13:24:01,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:24:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-28 13:24:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:24:01,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:01,560 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-11-28 13:24:01,560 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:01,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1825281605, now seen corresponding path program 2 times [2018-11-28 13:24:01,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:01,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:01,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:24:01,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:24:01,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:01,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:01,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:24:01,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:24:01,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:24:01,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:24:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:24:01,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2018-11-28 13:24:01,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:24:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:24:01,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:24:01,883 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 18 states. [2018-11-28 13:24:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:02,297 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-11-28 13:24:02,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:24:02,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-11-28 13:24:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:02,298 INFO L225 Difference]: With dead ends: 129 [2018-11-28 13:24:02,298 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 13:24:02,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-28 13:24:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 13:24:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-11-28 13:24:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 13:24:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-11-28 13:24:02,300 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 63 [2018-11-28 13:24:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:02,300 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-11-28 13:24:02,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:24:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-11-28 13:24:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 13:24:02,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:02,301 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-11-28 13:24:02,301 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:02,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash 789761038, now seen corresponding path program 1 times [2018-11-28 13:24:02,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:02,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:24:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 13:24:02,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:02,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:24:02,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:24:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:24:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:24:02,347 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 5 states. [2018-11-28 13:24:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:02,391 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-11-28 13:24:02,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:24:02,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 13:24:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:02,393 INFO L225 Difference]: With dead ends: 131 [2018-11-28 13:24:02,393 INFO L226 Difference]: Without dead ends: 131 [2018-11-28 13:24:02,394 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-11-28 13:24:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-28 13:24:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-11-28 13:24:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 13:24:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-11-28 13:24:02,397 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 66 [2018-11-28 13:24:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:02,397 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-11-28 13:24:02,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:24:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-11-28 13:24:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 13:24:02,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:02,398 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-11-28 13:24:02,406 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:02,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1443647666, now seen corresponding path program 3 times [2018-11-28 13:24:02,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:02,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:02,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 13:24:02,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:02,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:02,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:24:03,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 13:24:03,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:24:03,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:24:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2018-11-28 13:24:03,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:24:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:24:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:24:03,202 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 12 states. [2018-11-28 13:24:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:03,358 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-28 13:24:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:24:03,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-28 13:24:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:03,360 INFO L225 Difference]: With dead ends: 115 [2018-11-28 13:24:03,361 INFO L226 Difference]: Without dead ends: 115 [2018-11-28 13:24:03,361 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-11-28 13:24:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-28 13:24:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-28 13:24:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-28 13:24:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-11-28 13:24:03,363 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 67 [2018-11-28 13:24:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:03,364 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-11-28 13:24:03,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:24:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-11-28 13:24:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 13:24:03,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:03,364 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-11-28 13:24:03,364 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:03,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash -719196084, now seen corresponding path program 1 times [2018-11-28 13:24:03,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:03,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:03,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:24:03,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:24:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:24:03,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:24:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:24:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:24:03,517 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 12 states. [2018-11-28 13:24:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:03,765 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-11-28 13:24:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:24:03,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-11-28 13:24:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:03,767 INFO L225 Difference]: With dead ends: 119 [2018-11-28 13:24:03,767 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 13:24:03,768 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-11-28 13:24:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 13:24:03,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-11-28 13:24:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-28 13:24:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-11-28 13:24:03,771 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 77 [2018-11-28 13:24:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-11-28 13:24:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:24:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-11-28 13:24:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:24:03,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:03,773 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-11-28 13:24:03,773 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:03,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2021319984, now seen corresponding path program 1 times [2018-11-28 13:24:03,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:03,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:03,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:03,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:24:04,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:04,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:04,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:04,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:04,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:04,451 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-11-28 13:24:04,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 13:24:04,496 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-11-28 13:24:04,497 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-11-28 13:24:04,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-28 13:24:04,527 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-11-28 13:24:04,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 10 treesize of output 9 [2018-11-28 13:24:04,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,535 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-11-28 13:24:04,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 13:24:04,591 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-11-28 13:24:04,593 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-11-28 13:24:04,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,601 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-11-28 13:24:04,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 13:24:04,631 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-11-28 13:24:04,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:04,635 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-11-28 13:24:04,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:04,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-11-28 13:24:04,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-11-28 13:24:05,257 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-11-28 13:24:05,266 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-11-28 13:24:05,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:05,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:05,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:05,280 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-11-28 13:24:05,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:05,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:05,293 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-11-28 13:24:05,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2018-11-28 13:24:05,995 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 13:24:06,001 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-11-28 13:24:06,008 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-11-28 13:24:06,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:24:06,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:24:06,029 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-11-28 13:24:06,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2018-11-28 13:24:06,251 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-11-28 13:24:06,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:06,253 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-11-28 13:24:06,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:06,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:06,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:06,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-28 13:24:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2018-11-28 13:24:06,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:06,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-11-28 13:24:06,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-28 13:24:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-28 13:24:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2309, Unknown=1, NotChecked=96, Total=2550 [2018-11-28 13:24:06,316 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 51 states. [2018-11-28 13:24:09,592 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-11-28 13:24:11,693 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2018-11-28 13:24:12,520 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 13:24:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:13,270 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-11-28 13:24:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 13:24:13,271 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 80 [2018-11-28 13:24:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:13,271 INFO L225 Difference]: With dead ends: 138 [2018-11-28 13:24:13,271 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 13:24:13,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=402, Invalid=5003, Unknown=1, NotChecked=144, Total=5550 [2018-11-28 13:24:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 13:24:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-11-28 13:24:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 13:24:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-11-28 13:24:13,274 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 80 [2018-11-28 13:24:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:13,275 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-11-28 13:24:13,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-28 13:24:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-11-28 13:24:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:24:13,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:13,275 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-11-28 13:24:13,275 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:13,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2021319985, now seen corresponding path program 1 times [2018-11-28 13:24:13,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:13,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:13,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:13,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:13,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:24:14,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:14,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:14,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:14,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:14,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:14,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:14,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-28 13:24:14,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-28 13:24:14,393 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-11-28 13:24:14,394 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-11-28 13:24:14,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-28 13:24:14,428 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-11-28 13:24:14,430 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-11-28 13:24:14,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,437 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-11-28 13:24:14,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 13:24:14,505 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-11-28 13:24:14,507 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-11-28 13:24:14,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,515 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-11-28 13:24:14,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 13:24:14,552 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-11-28 13:24:14,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:14,555 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-11-28 13:24:14,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:14,563 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-11-28 13:24:14,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-11-28 13:24:15,223 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-11-28 13:24:15,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 54 treesize of output 48 [2018-11-28 13:24:15,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:15,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:15,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:15,234 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-11-28 13:24:15,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,247 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-11-28 13:24:15,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2018-11-28 13:24:15,462 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-11-28 13:24:15,470 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-11-28 13:24:15,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:24:15,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:24:15,506 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-11-28 13:24:15,508 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-11-28 13:24:15,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,520 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-11-28 13:24:15,522 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-11-28 13:24:15,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,530 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,548 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-11-28 13:24:15,548 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:108 [2018-11-28 13:24:15,900 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-11-28 13:24:15,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:15,903 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-11-28 13:24:15,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,919 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-11-28 13:24:15,920 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-11-28 13:24:15,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:15,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:13 [2018-11-28 13:24:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-11-28 13:24:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:16,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2018-11-28 13:24:16,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-28 13:24:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-28 13:24:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3255, Unknown=2, NotChecked=114, Total=3540 [2018-11-28 13:24:16,067 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 60 states. [2018-11-28 13:24:24,064 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-28 13:24:26,157 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-11-28 13:24:31,781 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-28 13:24:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:35,537 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-11-28 13:24:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 13:24:35,537 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 80 [2018-11-28 13:24:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:35,538 INFO L225 Difference]: With dead ends: 137 [2018-11-28 13:24:35,538 INFO L226 Difference]: Without dead ends: 137 [2018-11-28 13:24:35,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=505, Invalid=6975, Unknown=6, NotChecked=170, Total=7656 [2018-11-28 13:24:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-28 13:24:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-11-28 13:24:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 13:24:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-11-28 13:24:35,542 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 80 [2018-11-28 13:24:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:35,542 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-28 13:24:35,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-28 13:24:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-11-28 13:24:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:24:35,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:35,542 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-11-28 13:24:35,542 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:35,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1703840404, now seen corresponding path program 2 times [2018-11-28 13:24:35,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:35,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:35,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:35,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 13:24:35,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:35,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:35,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:24:35,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:24:35,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:24:35,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 13:24:35,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:35,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 13:24:35,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:24:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:24:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:35,738 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 7 states. [2018-11-28 13:24:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:35,780 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-11-28 13:24:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:24:35,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-28 13:24:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:35,781 INFO L225 Difference]: With dead ends: 109 [2018-11-28 13:24:35,781 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 13:24:35,781 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-11-28 13:24:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 13:24:35,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-28 13:24:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 13:24:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-11-28 13:24:35,784 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 83 [2018-11-28 13:24:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:35,784 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-11-28 13:24:35,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:24:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-11-28 13:24:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 13:24:35,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:35,785 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-11-28 13:24:35,785 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:35,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -136290336, now seen corresponding path program 1 times [2018-11-28 13:24:35,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:35,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:35,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:24:35,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 13:24:35,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:35,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:35,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:35,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 13:24:35,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:24:35,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 13:24:35,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:24:35,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:24:35,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:24:35,929 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 9 states. [2018-11-28 13:24:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:35,998 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-28 13:24:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:24:35,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-28 13:24:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:35,999 INFO L225 Difference]: With dead ends: 115 [2018-11-28 13:24:36,000 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 13:24:36,000 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-11-28 13:24:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 13:24:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-28 13:24:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 13:24:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-11-28 13:24:36,003 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 88 [2018-11-28 13:24:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:36,003 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-11-28 13:24:36,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:24:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-28 13:24:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 13:24:36,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:36,004 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-11-28 13:24:36,004 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:36,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:36,004 INFO L82 PathProgramCache]: Analyzing trace with hash 674914628, now seen corresponding path program 1 times [2018-11-28 13:24:36,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:36,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:36,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:36,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 13:24:36,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:36,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:24:36,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:24:36,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:24:36,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:24:36,113 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 12 states. [2018-11-28 13:24:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:36,325 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-28 13:24:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:24:36,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-11-28 13:24:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:36,327 INFO L225 Difference]: With dead ends: 107 [2018-11-28 13:24:36,327 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 13:24:36,327 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-11-28 13:24:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 13:24:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 13:24:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 13:24:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-11-28 13:24:36,330 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 91 [2018-11-28 13:24:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:36,330 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-11-28 13:24:36,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:24:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-28 13:24:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:24:36,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:36,331 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-11-28 13:24:36,331 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:36,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1668542446, now seen corresponding path program 1 times [2018-11-28 13:24:36,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 13:24:36,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:36,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 13:24:36,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:24:36,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:24:36,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:24:36,396 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-11-28 13:24:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:36,507 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-28 13:24:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:24:36,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-28 13:24:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:36,508 INFO L225 Difference]: With dead ends: 109 [2018-11-28 13:24:36,508 INFO L226 Difference]: Without dead ends: 107 [2018-11-28 13:24:36,508 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-11-28 13:24:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-28 13:24:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 13:24:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 13:24:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-28 13:24:36,511 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 94 [2018-11-28 13:24:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-28 13:24:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:24:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-28 13:24:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:24:36,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:36,512 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-11-28 13:24:36,512 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:36,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1639868767, now seen corresponding path program 1 times [2018-11-28 13:24:36,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:36,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 13:24:36,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:36,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:36,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:36,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:36,655 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-11-28 13:24:36,656 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-11-28 13:24:36,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:36,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:36,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:36,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-28 13:24:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 13:24:36,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:36,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 13:24:36,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:24:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:24:36,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:24:36,687 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 11 states. [2018-11-28 13:24:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:36,875 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-28 13:24:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:24:36,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-28 13:24:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:36,876 INFO L225 Difference]: With dead ends: 119 [2018-11-28 13:24:36,876 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 13:24:36,876 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-11-28 13:24:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 13:24:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2018-11-28 13:24:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 13:24:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-11-28 13:24:36,879 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 94 [2018-11-28 13:24:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:36,879 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-11-28 13:24:36,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:24:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-28 13:24:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:24:36,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:36,880 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-11-28 13:24:36,880 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:36,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1639868768, now seen corresponding path program 1 times [2018-11-28 13:24:36,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 13:24:37,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:37,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:37,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:37,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:37,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:37,689 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-11-28 13:24:37,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 13:24:37,764 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-11-28 13:24:37,765 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-11-28 13:24:37,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,776 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-11-28 13:24:37,778 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-11-28 13:24:37,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-28 13:24:37,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-28 13:24:37,838 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-11-28 13:24:37,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 13:24:37,855 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-11-28 13:24:37,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-11-28 13:24:37,948 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-11-28 13:24:37,950 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-11-28 13:24:37,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,973 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-11-28 13:24:37,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, 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-11-28 13:24:37,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:37,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2018-11-28 13:24:38,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:38,036 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-11-28 13:24:38,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:38,039 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-11-28 13:24:38,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:38,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:38,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:38,063 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-11-28 13:24:38,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:38,066 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-11-28 13:24:38,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:38,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:38,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:38,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:96 [2018-11-28 13:24:39,096 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-11-28 13:24:39,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,105 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-11-28 13:24:39,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,121 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-11-28 13:24:39,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:24:39,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:39,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,162 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-11-28 13:24:39,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:39,167 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-11-28 13:24:39,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:39,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:39,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:39,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:82 [2018-11-28 13:24:40,066 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-11-28 13:24:40,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:40,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:40,071 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-11-28 13:24:40,084 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-11-28 13:24:40,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-11-28 13:24:40,175 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-11-28 13:24:40,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:24:40,178 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-11-28 13:24:40,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:40,190 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-11-28 13:24:40,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 13:24:40,203 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-11-28 13:24:40,203 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 13:24:40,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 13:24:40,370 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-11-28 13:24:40,384 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-11-28 13:24:40,384 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,406 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-11-28 13:24:40,420 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-11-28 13:24:40,420 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,443 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-11-28 13:24:40,458 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-11-28 13:24:40,459 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,478 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,481 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-11-28 13:24:40,496 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-11-28 13:24:40,496 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,515 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:24:40,619 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-11-28 13:24:40,619 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:117, output treesize:343 [2018-11-28 13:24:41,712 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-11-28 13:24:41,714 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-11-28 13:24:41,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,742 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-11-28 13:24:41,743 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-11-28 13:24:41,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,768 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-11-28 13:24:41,769 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-11-28 13:24:41,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:41,783 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:152, output treesize:11 [2018-11-28 13:24:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2018-11-28 13:24:41,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:24:41,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 65 [2018-11-28 13:24:41,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-28 13:24:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-28 13:24:41,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3830, Unknown=2, NotChecked=250, Total=4290 [2018-11-28 13:24:41,908 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 66 states. [2018-11-28 13:24:44,507 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2018-11-28 13:24:46,895 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-11-28 13:24:49,475 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-11-28 13:24:49,829 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-11-28 13:24:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:50,525 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-28 13:24:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 13:24:50,525 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2018-11-28 13:24:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:50,526 INFO L225 Difference]: With dead ends: 119 [2018-11-28 13:24:50,526 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 13:24:50,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=567, Invalid=7810, Unknown=3, NotChecked=362, Total=8742 [2018-11-28 13:24:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 13:24:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-11-28 13:24:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 13:24:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-11-28 13:24:50,529 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 94 [2018-11-28 13:24:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:50,529 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-11-28 13:24:50,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-28 13:24:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-28 13:24:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:24:50,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:50,530 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-11-28 13:24:50,530 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:24:50,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:50,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2024056639, now seen corresponding path program 1 times [2018-11-28 13:24:50,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:50,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:50,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:50,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:24:51,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:24:51,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:24:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:51,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:24:51,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:51,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:51,086 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-11-28 13:24:51,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 13:24:51,112 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-11-28 13:24:51,114 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-11-28 13:24:51,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 13:24:51,144 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-11-28 13:24:51,145 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-11-28 13:24:51,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,153 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-11-28 13:24:51,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-28 13:24:51,208 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-11-28 13:24:51,210 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-11-28 13:24:51,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,220 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-11-28 13:24:51,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-11-28 13:24:51,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, 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-11-28 13:24:51,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:51,250 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-11-28 13:24:51,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,258 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-11-28 13:24:51,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-28 13:24:51,867 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-11-28 13:24:51,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 13:24:51,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:51,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:51,878 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-11-28 13:24:51,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:24:51,889 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-11-28 13:24:51,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2018-11-28 13:24:52,474 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-11-28 13:24:52,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:24:52,478 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:24:52,482 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-11-28 13:24:52,489 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-11-28 13:24:52,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:24:52,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:24:52,509 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-11-28 13:24:52,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2018-11-28 13:25:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2018-11-28 13:25:04,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:25:04,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 54 [2018-11-28 13:25:04,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-28 13:25:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-28 13:25:04,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2488, Unknown=2, NotChecked=202, Total=2862 [2018-11-28 13:25:04,921 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 54 states. [2018-11-28 13:25:26,655 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-11-28 13:25:35,094 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-11-28 13:25:37,621 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 13:25:37,767 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-28 13:25:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:37,927 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-11-28 13:25:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 13:25:37,927 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 99 [2018-11-28 13:25:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:37,928 INFO L225 Difference]: With dead ends: 112 [2018-11-28 13:25:37,928 INFO L226 Difference]: Without dead ends: 108 [2018-11-28 13:25:37,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 73 SyntacticMatches, 14 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=437, Invalid=5116, Unknown=5, NotChecked=294, Total=5852 [2018-11-28 13:25:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-28 13:25:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-28 13:25:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 13:25:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2018-11-28 13:25:37,931 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 99 [2018-11-28 13:25:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:37,932 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2018-11-28 13:25:37,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-28 13:25:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2018-11-28 13:25:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:25:37,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:37,932 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-11-28 13:25:37,933 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:25:37,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -603173294, now seen corresponding path program 1 times [2018-11-28 13:25:37,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:37,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:37,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:37,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:37,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 13:25:38,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:25:38,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:25:38,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:38,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:25:39,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,089 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-11-28 13:25:39,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-11-28 13:25:39,169 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-11-28 13:25:39,171 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-11-28 13:25:39,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,184 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-11-28 13:25:39,185 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-11-28 13:25:39,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-28 13:25:39,242 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-11-28 13:25:39,244 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-11-28 13:25:39,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,261 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-11-28 13:25:39,263 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-11-28 13:25:39,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2018-11-28 13:25:39,383 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-11-28 13:25:39,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,385 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-11-28 13:25:39,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,409 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-11-28 13:25:39,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,413 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-11-28 13:25:39,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:81 [2018-11-28 13:25:39,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,519 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-11-28 13:25:39,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,534 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-11-28 13:25:39,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:25:39,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,607 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-11-28 13:25:39,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,610 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-11-28 13:25:39,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:125 [2018-11-28 13:25:39,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,868 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-11-28 13:25:39,878 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-11-28 13:25:39,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:25:39,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,892 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-11-28 13:25:39,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:25:39,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:25:39,912 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-11-28 13:25:39,913 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-11-28 13:25:39,913 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:39,919 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-11-28 13:25:39,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:39,926 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-11-28 13:25:39,926 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2018-11-28 13:25:40,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,076 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-11-28 13:25:40,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,094 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-11-28 13:25:40,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:25:40,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,152 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-11-28 13:25:40,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,157 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-11-28 13:25:40,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,180 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-11-28 13:25:40,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:168, output treesize:138 [2018-11-28 13:25:40,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,237 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-11-28 13:25:40,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,247 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-11-28 13:25:40,248 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-11-28 13:25:40,290 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-11-28 13:25:40,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,297 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-11-28 13:25:40,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:25:40,307 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-11-28 13:25:40,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 13:25:40,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,314 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-11-28 13:25:40,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 13:25:40,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 13:25:40,416 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-11-28 13:25:40,418 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-11-28 13:25:40,418 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,424 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-11-28 13:25:40,424 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,428 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,429 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-11-28 13:25:40,431 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-11-28 13:25:40,431 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,437 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-11-28 13:25:40,438 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,441 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,443 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-11-28 13:25:40,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, 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-11-28 13:25:40,445 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,453 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-11-28 13:25:40,453 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,456 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,458 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-11-28 13:25:40,460 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-11-28 13:25:40,460 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,467 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-11-28 13:25:40,467 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,471 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,485 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-11-28 13:25:40,485 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2018-11-28 13:25:40,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,683 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-11-28 13:25:40,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,703 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-11-28 13:25:40,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:25:40,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,760 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-11-28 13:25:40,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:40,765 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-11-28 13:25:40,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,771 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-11-28 13:25:40,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:40,788 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-11-28 13:25:40,789 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:169, output treesize:80 [2018-11-28 13:25:41,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:41,606 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-11-28 13:25:41,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:41,622 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-11-28 13:25:41,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:25:41,639 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-11-28 13:25:41,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:25:41,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:25:41,658 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-11-28 13:25:41,658 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:35 [2018-11-28 13:25:41,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:41,825 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-11-28 13:25:41,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:41,829 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-11-28 13:25:41,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 13:25:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:25:41,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:25:41,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 70 [2018-11-28 13:25:41,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-28 13:25:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-28 13:25:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4608, Unknown=0, NotChecked=0, Total=4830 [2018-11-28 13:25:41,931 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 70 states. [2018-11-28 13:25:43,283 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-11-28 13:25:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:25:46,472 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-28 13:25:46,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 13:25:46,472 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 99 [2018-11-28 13:25:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:25:46,473 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:25:46,473 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 13:25:46,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=608, Invalid=8512, Unknown=0, NotChecked=0, Total=9120 [2018-11-28 13:25:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 13:25:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-28 13:25:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 13:25:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-11-28 13:25:46,476 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 99 [2018-11-28 13:25:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:25:46,477 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-11-28 13:25:46,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-28 13:25:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-11-28 13:25:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:25:46,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:25:46,477 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-11-28 13:25:46,478 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION]=== [2018-11-28 13:25:46,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:25:46,478 INFO L82 PathProgramCache]: Analyzing trace with hash 616928174, now seen corresponding path program 1 times [2018-11-28 13:25:46,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:25:46,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:25:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:46,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:46,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:25:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:25:47,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:25:47,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/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-11-28 13:25:47,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:25:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:25:47,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:25:47,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:47,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:47,815 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-11-28 13:25:47,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:34 [2018-11-28 13:25:47,906 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-11-28 13:25:47,908 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-11-28 13:25:47,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-28 13:25:47,964 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-11-28 13:25:47,965 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-11-28 13:25:47,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:47,978 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-11-28 13:25:47,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-11-28 13:25:48,087 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-11-28 13:25:48,089 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-11-28 13:25:48,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:48,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:48,104 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-11-28 13:25:48,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-11-28 13:25:48,151 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-11-28 13:25:48,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:48,154 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-11-28 13:25:48,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:48,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:48,170 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-11-28 13:25:48,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-11-28 13:25:48,416 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-11-28 13:25:48,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:48,426 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-11-28 13:25:48,428 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-11-28 13:25:48,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:48,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:48,433 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-11-28 13:25:48,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:25:48,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:25:48,442 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-11-28 13:25:48,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-11-28 13:25:53,892 WARN L180 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:25:53,899 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-11-28 13:25:53,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:53,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:53,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:53,905 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-11-28 13:25:53,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:53,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:25:53,928 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-11-28 13:25:53,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:105, output treesize:85 [2018-11-28 13:25:53,990 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-11-28 13:25:53,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,000 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-11-28 13:25:54,002 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-11-28 13:25:54,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:25:54,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:25:54,011 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-11-28 13:25:54,011 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:25:54,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:25:54,020 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-11-28 13:25:54,020 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:72, output treesize:18 [2018-11-28 13:26:01,582 WARN L180 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 13:26:01,588 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-11-28 13:26:01,596 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-11-28 13:26:01,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:26:01,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:26:01,631 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-11-28 13:26:01,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:156 [2018-11-28 13:26:01,731 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-11-28 13:26:01,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:26:01,738 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-11-28 13:26:01,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-11-28 13:26:01,878 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-11-28 13:26:01,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:26:01,886 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-11-28 13:26:01,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:42 [2018-11-28 13:26:02,246 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-11-28 13:26:02,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:26:02,258 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-11-28 13:26:02,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:26:02,265 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-11-28 13:26:02,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:31 [2018-11-28 13:26:04,569 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 13:26:17,779 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 13:26:19,782 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-11-28 13:26:19,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:26:19,787 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:26:19,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:26:19,788 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-11-28 13:26:19,790 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-11-28 13:26:19,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:26:19,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:26:19,815 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-11-28 13:26:19,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:26:19,817 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-11-28 13:26:19,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:26:19,832 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:26:19,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:26:19,833 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:26:19,833 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-11-28 13:26:19,834 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:26:19,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:26:19,849 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:26:19,849 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-11-28 13:26:19,850 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:26:19,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 13:26:19,877 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-11-28 13:26:19,878 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:102, output treesize:51 [2018-11-28 13:26:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:26:20,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:26:20,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 68 [2018-11-28 13:26:20,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-28 13:26:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-28 13:26:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=4301, Unknown=29, NotChecked=132, Total=4692 [2018-11-28 13:26:20,016 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 69 states. [2018-11-28 13:26:30,043 WARN L180 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 13:26:38,517 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 13:26:51,017 WARN L180 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-11-28 13:26:55,161 WARN L180 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-11-28 13:27:01,210 WARN L180 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2018-11-28 13:27:05,817 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-28 13:27:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:27:05,818 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-28 13:27:05,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 13:27:05,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 104 [2018-11-28 13:27:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:27:05,818 INFO L225 Difference]: With dead ends: 99 [2018-11-28 13:27:05,818 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:27:05,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2232 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=588, Invalid=8881, Unknown=41, NotChecked=192, Total=9702 [2018-11-28 13:27:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:27:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:27:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:27:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:27:05,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-11-28 13:27:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:27:05,819 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:27:05,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-28 13:27:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:27:05,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:27:05,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:27:05 BoogieIcfgContainer [2018-11-28 13:27:05,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:27:05,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:27:05,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:27:05,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:27:05,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:22:37" (3/4) ... [2018-11-28 13:27:05,826 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:27:05,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-11-28 13:27:05,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-11-28 13:27:05,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-28 13:27:05,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-11-28 13:27:05,836 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-28 13:27:05,837 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-28 13:27:05,837 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:27:05,873 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a7ef3cd0-4ebf-4cf1-a4e2-38baad32525b/bin-2019/uautomizer/witness.graphml [2018-11-28 13:27:05,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:27:05,874 INFO L168 Benchmark]: Toolchain (without parser) took 269689.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 950.6 MB in the beginning and 871.8 MB in the end (delta: 78.8 MB). Peak memory consumption was 249.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:27:05,875 INFO L168 Benchmark]: CDTParser took 0.11 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-11-28 13:27:05,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:27:05,875 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:27:05,875 INFO L168 Benchmark]: RCFGBuilder took 456.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:27:05,875 INFO L168 Benchmark]: TraceAbstraction took 268771.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.1 MB). Free memory was 1.1 GB in the beginning and 878.5 MB in the end (delta: 176.4 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:27:05,876 INFO L168 Benchmark]: Witness Printer took 50.34 ms. Allocated memory is still 1.2 GB. Free memory was 878.5 MB in the beginning and 871.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:27:05,877 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 456.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 268771.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.1 MB). Free memory was 1.1 GB in the beginning and 878.5 MB in the end (delta: 176.4 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. * Witness Printer took 50.34 ms. Allocated memory is still 1.2 GB. Free memory was 878.5 MB in the beginning and 871.8 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: 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: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 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: 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: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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, 268.7s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 168.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2923 SDtfs, 3134 SDslu, 16561 SDs, 0 SdLazy, 28590 SolverSat, 855 SolverUnsat, 93 SolverUnknown, 0 SolverNotchecked, 99.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2169 GetRequests, 1126 SyntacticMatches, 100 SemanticMatches, 943 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 12424 ImplicationChecksByTransitivity, 159.3s 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.5s SatisfiabilityAnalysisTime, 97.0s 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...