./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/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 d9cd680588366d8f4117005099c5fa975e5f03ed ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:20:59,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:20:59,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:20:59,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:20:59,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:20:59,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:20:59,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:20:59,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:20:59,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:20:59,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:20:59,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:20:59,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:20:59,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:20:59,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:20:59,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:20:59,826 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:20:59,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:20:59,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:20:59,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:20:59,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:20:59,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:20:59,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:20:59,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:20:59,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:20:59,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:20:59,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:20:59,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:20:59,833 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:20:59,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:20:59,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:20:59,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:20:59,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:20:59,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:20:59,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:20:59,835 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:20:59,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:20:59,835 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 01:20:59,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:20:59,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:20:59,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:20:59,843 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:20:59,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:20:59,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:20:59,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:20:59,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:20:59,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:20:59,845 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:20:59,845 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:20:59,845 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:20:59,845 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_1fb1c789-3716-4b11-99da-d5df236dedbb/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 -> d9cd680588366d8f4117005099c5fa975e5f03ed [2018-12-09 01:20:59,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:20:59,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:20:59,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:20:59,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:20:59,871 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:20:59,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:20:59,906 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/data/7b6bb6013/edcc7bad12934fe3a8bebd50da40110c/FLAG3eb7a5e48 [2018-12-09 01:21:00,253 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:21:00,253 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:21:00,259 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/data/7b6bb6013/edcc7bad12934fe3a8bebd50da40110c/FLAG3eb7a5e48 [2018-12-09 01:21:00,267 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/data/7b6bb6013/edcc7bad12934fe3a8bebd50da40110c [2018-12-09 01:21:00,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:21:00,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 01:21:00,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:21:00,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:21:00,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:21:00,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b7dfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00, skipping insertion in model container [2018-12-09 01:21:00,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:21:00,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:21:00,445 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:21:00,485 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:21:00,511 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:21:00,532 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:21:00,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00 WrapperNode [2018-12-09 01:21:00,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:21:00,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:21:00,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:21:00,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:21:00,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... [2018-12-09 01:21:00,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:21:00,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:21:00,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:21:00,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:21:00,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:21:00,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:21:00,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:21:00,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 01:21:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 01:21:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:21:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 01:21:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 01:21:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-12-09 01:21:00,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:21:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-09 01:21:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 01:21:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 01:21:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 01:21:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 01:21:00,594 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 01:21:00,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 01:21:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 01:21:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-09 01:21:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 01:21:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 01:21:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-12-09 01:21:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:21:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:21:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:21:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:21:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:21:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:21:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:21:00,851 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:21:00,851 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 01:21:00,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:00 BoogieIcfgContainer [2018-12-09 01:21:00,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:21:00,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:21:00,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:21:00,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:21:00,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:21:00" (1/3) ... [2018-12-09 01:21:00,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdc81df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:21:00, skipping insertion in model container [2018-12-09 01:21:00,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:21:00" (2/3) ... [2018-12-09 01:21:00,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdc81df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:21:00, skipping insertion in model container [2018-12-09 01:21:00,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:00" (3/3) ... [2018-12-09 01:21:00,858 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:21:00,866 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:21:00,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-09 01:21:00,883 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-09 01:21:00,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:21:00,898 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:21:00,899 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:21:00,899 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:21:00,899 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:21:00,899 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:21:00,899 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:21:00,899 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:21:00,899 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:21:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-12-09 01:21:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:21:00,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:00,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:00,916 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:00,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1767081539, now seen corresponding path program 1 times [2018-12-09 01:21:00,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:00,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:00,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:00,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:01,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:21:01,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:21:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:21:01,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:21:01,031 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2018-12-09 01:21:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,088 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-09 01:21:01,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:21:01,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:21:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,097 INFO L225 Difference]: With dead ends: 69 [2018-12-09 01:21:01,097 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 01:21:01,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:21:01,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 01:21:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-12-09 01:21:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 01:21:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-09 01:21:01,122 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 11 [2018-12-09 01:21:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,122 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-09 01:21:01,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:21:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-09 01:21:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:21:01,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1767081540, now seen corresponding path program 1 times [2018-12-09 01:21:01,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:21:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:21:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:21:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:21:01,166 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 3 states. [2018-12-09 01:21:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,196 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-09 01:21:01,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:21:01,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:21:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,197 INFO L225 Difference]: With dead ends: 59 [2018-12-09 01:21:01,197 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 01:21:01,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:21:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 01:21:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-12-09 01:21:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 01:21:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-12-09 01:21:01,201 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 11 [2018-12-09 01:21:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,201 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-12-09 01:21:01,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:21:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-12-09 01:21:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:21:01,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,202 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1402216098, now seen corresponding path program 1 times [2018-12-09 01:21:01,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:01,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:21:01,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:21:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:21:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:21:01,223 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-12-09 01:21:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,246 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-12-09 01:21:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:21:01,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-09 01:21:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,247 INFO L225 Difference]: With dead ends: 58 [2018-12-09 01:21:01,247 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 01:21:01,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:21:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 01:21:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-12-09 01:21:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 01:21:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-12-09 01:21:01,254 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 15 [2018-12-09 01:21:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,255 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-12-09 01:21:01,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:21:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-12-09 01:21:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:21:01,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,255 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -336303097, now seen corresponding path program 1 times [2018-12-09 01:21:01,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:01,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:21:01,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:21:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:21:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:21:01,292 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 3 states. [2018-12-09 01:21:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,307 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-09 01:21:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:21:01,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 01:21:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,308 INFO L225 Difference]: With dead ends: 66 [2018-12-09 01:21:01,308 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 01:21:01,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:21:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 01:21:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-12-09 01:21:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 01:21:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-12-09 01:21:01,313 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2018-12-09 01:21:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,313 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-12-09 01:21:01,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:21:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-12-09 01:21:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 01:21:01,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1090178234, now seen corresponding path program 1 times [2018-12-09 01:21:01,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:01,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:21:01,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:21:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:21:01,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:21:01,361 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2018-12-09 01:21:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,488 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-09 01:21:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:21:01,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 01:21:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,489 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:21:01,489 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 01:21:01,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:21:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 01:21:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2018-12-09 01:21:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 01:21:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-12-09 01:21:01,493 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2018-12-09 01:21:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,493 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-12-09 01:21:01,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:21:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-12-09 01:21:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 01:21:01,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,494 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1090178235, now seen corresponding path program 1 times [2018-12-09 01:21:01,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:21:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:21:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:21:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:21:01,520 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2018-12-09 01:21:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,537 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-09 01:21:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:21:01,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 01:21:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,538 INFO L225 Difference]: With dead ends: 65 [2018-12-09 01:21:01,538 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 01:21:01,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:21:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 01:21:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-09 01:21:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 01:21:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-09 01:21:01,541 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-12-09 01:21:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,541 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-09 01:21:01,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:21:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-09 01:21:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:21:01,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,542 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,543 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1878714113, now seen corresponding path program 1 times [2018-12-09 01:21:01,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:01,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:01,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:01,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:21:01,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:01,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:01,668 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 17 treesize of output 21 [2018-12-09 01:21:01,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:01,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-09 01:21:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:01,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-12-09 01:21:01,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:21:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:21:01,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:01,717 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 7 states. [2018-12-09 01:21:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:01,787 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-09 01:21:01,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:21:01,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-09 01:21:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:01,788 INFO L225 Difference]: With dead ends: 65 [2018-12-09 01:21:01,788 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 01:21:01,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:21:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 01:21:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-12-09 01:21:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 01:21:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-09 01:21:01,791 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-12-09 01:21:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:01,791 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-09 01:21:01,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:21:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-09 01:21:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:21:01,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:01,791 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:01,792 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:01,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1878714112, now seen corresponding path program 1 times [2018-12-09 01:21:01,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:01,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:01,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:01,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:01,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:01,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:01,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:21:01,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:01,918 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 12 treesize of output 15 [2018-12-09 01:21:01,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:01,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:01,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:01,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:01,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:01,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-09 01:21:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:01,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:01,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-12-09 01:21:01,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 01:21:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 01:21:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:21:01,973 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 8 states. [2018-12-09 01:21:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:02,151 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-09 01:21:02,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:21:02,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-09 01:21:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:02,152 INFO L225 Difference]: With dead ends: 64 [2018-12-09 01:21:02,152 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 01:21:02,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:21:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 01:21:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-12-09 01:21:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 01:21:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-09 01:21:02,156 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 22 [2018-12-09 01:21:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:02,156 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-09 01:21:02,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 01:21:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-09 01:21:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:21:02,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:02,157 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, 1, 1, 1, 1] [2018-12-09 01:21:02,157 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:02,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 596908978, now seen corresponding path program 1 times [2018-12-09 01:21:02,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:02,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:02,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:02,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:02,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:02,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:02,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 01:21:02,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:21:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:21:02,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:21:02,235 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-12-09 01:21:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:02,253 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-09 01:21:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:21:02,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-09 01:21:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:02,254 INFO L225 Difference]: With dead ends: 71 [2018-12-09 01:21:02,254 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 01:21:02,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 01:21:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-12-09 01:21:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 01:21:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-09 01:21:02,257 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 24 [2018-12-09 01:21:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:02,257 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-09 01:21:02,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:21:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-09 01:21:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 01:21:02,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:02,258 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] [2018-12-09 01:21:02,258 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:02,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:02,258 INFO L82 PathProgramCache]: Analyzing trace with hash 279610810, now seen corresponding path program 2 times [2018-12-09 01:21:02,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:02,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:02,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:02,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:02,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:02,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:02,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:21:02,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:21:02,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:21:02,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:02,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:02,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 6 [2018-12-09 01:21:02,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:21:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:21:02,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:21:02,373 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-12-09 01:21:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:02,408 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-09 01:21:02,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:21:02,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-09 01:21:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:02,409 INFO L225 Difference]: With dead ends: 61 [2018-12-09 01:21:02,409 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 01:21:02,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:21:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 01:21:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 01:21:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 01:21:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-09 01:21:02,411 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 31 [2018-12-09 01:21:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:02,411 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-09 01:21:02,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:21:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-09 01:21:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:21:02,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:02,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:02,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:02,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 898443166, now seen corresponding path program 1 times [2018-12-09 01:21:02,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:02,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:02,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:02,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:21:02,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:02,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:02,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:02,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:02,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:02,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:02,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:02,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:02,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:21:02,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:02,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:02,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-09 01:21:02,991 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 23 treesize of output 20 [2018-12-09 01:21:02,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:02,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:03,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:03,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-09 01:21:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:03,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:03,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-12-09 01:21:03,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 01:21:03,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 01:21:03,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=188, Unknown=1, NotChecked=0, Total=240 [2018-12-09 01:21:03,054 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 16 states. [2018-12-09 01:21:05,984 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 01:21:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:07,490 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-12-09 01:21:07,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:21:07,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-12-09 01:21:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:07,491 INFO L225 Difference]: With dead ends: 92 [2018-12-09 01:21:07,491 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 01:21:07,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=99, Invalid=316, Unknown=5, NotChecked=0, Total=420 [2018-12-09 01:21:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 01:21:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-12-09 01:21:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 01:21:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-09 01:21:07,495 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 32 [2018-12-09 01:21:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:07,496 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-09 01:21:07,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 01:21:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-09 01:21:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:21:07,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:07,496 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:07,497 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:07,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 898443167, now seen corresponding path program 1 times [2018-12-09 01:21:07,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:07,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:07,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:07,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:07,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:07,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:07,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:07,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:07,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:07,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:07,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:07,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:07,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:07,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:21:07,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:07,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:07,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 01:21:07,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:07,718 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 23 treesize of output 34 [2018-12-09 01:21:07,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:07,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:07,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:07,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:07,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:07,737 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 01:21:07,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:07,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:07,749 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-09 01:21:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:07,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:07,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-12-09 01:21:07,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 01:21:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 01:21:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:21:07,810 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 15 states. [2018-12-09 01:21:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:10,996 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-12-09 01:21:10,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:21:10,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-12-09 01:21:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:10,996 INFO L225 Difference]: With dead ends: 103 [2018-12-09 01:21:10,996 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 01:21:10,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=77, Invalid=301, Unknown=2, NotChecked=0, Total=380 [2018-12-09 01:21:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 01:21:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-12-09 01:21:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 01:21:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2018-12-09 01:21:10,999 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2018-12-09 01:21:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:10,999 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2018-12-09 01:21:10,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 01:21:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2018-12-09 01:21:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:21:11,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:11,000 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:11,000 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:11,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2081934351, now seen corresponding path program 1 times [2018-12-09 01:21:11,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:11,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:11,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:21:11,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:21:11,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:21:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:21:11,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:21:11,053 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 10 states. [2018-12-09 01:21:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:11,230 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-12-09 01:21:11,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:21:11,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-12-09 01:21:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:11,230 INFO L225 Difference]: With dead ends: 118 [2018-12-09 01:21:11,230 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 01:21:11,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:21:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 01:21:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2018-12-09 01:21:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:21:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-12-09 01:21:11,234 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 33 [2018-12-09 01:21:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:11,234 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-12-09 01:21:11,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:21:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-12-09 01:21:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:21:11,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:11,234 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:11,234 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:11,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2081934352, now seen corresponding path program 1 times [2018-12-09 01:21:11,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:11,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:21:11,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:11,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:21:11,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:21:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:21:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:21:11,313 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 10 states. [2018-12-09 01:21:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:11,561 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2018-12-09 01:21:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:21:11,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-12-09 01:21:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:11,562 INFO L225 Difference]: With dead ends: 121 [2018-12-09 01:21:11,562 INFO L226 Difference]: Without dead ends: 121 [2018-12-09 01:21:11,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:21:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-09 01:21:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-12-09 01:21:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:21:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-09 01:21:11,565 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 33 [2018-12-09 01:21:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:11,565 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-09 01:21:11,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:21:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-09 01:21:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:21:11,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:11,566 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:11,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:11,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash -716486686, now seen corresponding path program 1 times [2018-12-09 01:21:11,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:11,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:11,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:11,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:11,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:11,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:11,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:11,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:11,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:11,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:11,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:21:11,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:11,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:11,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:11,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 01:21:11,798 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 13 treesize of output 10 [2018-12-09 01:21:11,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:11,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-12-09 01:21:11,819 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 23 treesize of output 18 [2018-12-09 01:21:11,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:11,822 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 18 treesize of output 27 [2018-12-09 01:21:11,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 01:21:11,847 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 56 treesize of output 50 [2018-12-09 01:21:11,849 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 16 treesize of output 15 [2018-12-09 01:21:11,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:11,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:11,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-12-09 01:21:12,094 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 93 treesize of output 83 [2018-12-09 01:21:12,096 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 83 treesize of output 70 [2018-12-09 01:21:12,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:12,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2018-12-09 01:21:12,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 64 [2018-12-09 01:21:12,153 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 39 [2018-12-09 01:21:12,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,185 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 47 treesize of output 38 [2018-12-09 01:21:12,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 48 [2018-12-09 01:21:12,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:12,231 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 24 treesize of output 14 [2018-12-09 01:21:12,232 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:12,242 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:83, output treesize:5 [2018-12-09 01:21:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:12,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:12,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-12-09 01:21:12,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 01:21:12,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 01:21:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-12-09 01:21:12,260 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 28 states. [2018-12-09 01:21:12,977 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-12-09 01:21:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:14,094 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2018-12-09 01:21:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 01:21:14,095 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-12-09 01:21:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:14,095 INFO L225 Difference]: With dead ends: 125 [2018-12-09 01:21:14,095 INFO L226 Difference]: Without dead ends: 125 [2018-12-09 01:21:14,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 01:21:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-09 01:21:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2018-12-09 01:21:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 01:21:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-12-09 01:21:14,100 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 36 [2018-12-09 01:21:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:14,100 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-12-09 01:21:14,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 01:21:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-12-09 01:21:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:21:14,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:14,101 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:14,101 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:14,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash -716486685, now seen corresponding path program 1 times [2018-12-09 01:21:14,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:14,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:14,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:14,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:14,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:14,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:14,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:14,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:14,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:14,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:14,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:21:14,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:14,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:14,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:14,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-09 01:21:14,455 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 13 treesize of output 10 [2018-12-09 01:21:14,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:14,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,466 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 13 treesize of output 10 [2018-12-09 01:21:14,467 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 10 treesize of output 9 [2018-12-09 01:21:14,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-09 01:21:14,502 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 23 treesize of output 18 [2018-12-09 01:21:14,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:14,505 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 18 treesize of output 27 [2018-12-09 01:21:14,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,523 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 23 treesize of output 18 [2018-12-09 01:21:14,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:14,526 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:14,526 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 18 treesize of output 36 [2018-12-09 01:21:14,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-12-09 01:21:14,572 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 83 treesize of output 77 [2018-12-09 01:21:14,574 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 16 treesize of output 15 [2018-12-09 01:21:14,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,597 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 44 treesize of output 45 [2018-12-09 01:21:14,599 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 16 treesize of output 15 [2018-12-09 01:21:14,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:14,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:14,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2018-12-09 01:21:15,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 148 [2018-12-09 01:21:15,011 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 137 treesize of output 128 [2018-12-09 01:21:15,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,069 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 133 treesize of output 103 [2018-12-09 01:21:15,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,121 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 128 treesize of output 98 [2018-12-09 01:21:15,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 87 treesize of output 77 [2018-12-09 01:21:15,171 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,219 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 131 treesize of output 122 [2018-12-09 01:21:15,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-12-09 01:21:15,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,310 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:15,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 103 [2018-12-09 01:21:15,311 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,356 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 0 case distinctions, treesize of input 122 treesize of output 104 [2018-12-09 01:21:15,356 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-09 01:21:15,443 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2018-12-09 01:21:15,445 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 66 treesize of output 57 [2018-12-09 01:21:15,445 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,468 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 57 treesize of output 45 [2018-12-09 01:21:15,468 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-09 01:21:15,488 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,505 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-12-09 01:21:15,505 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,521 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 43 treesize of output 33 [2018-12-09 01:21:15,522 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,534 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:21:15,541 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 70 [2018-12-09 01:21:15,543 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 62 treesize of output 53 [2018-12-09 01:21:15,543 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,566 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:15,566 INFO L478 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-12-09 01:21:15,567 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,589 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-12-09 01:21:15,594 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 9 treesize of output 1 [2018-12-09 01:21:15,594 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,604 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 28 treesize of output 16 [2018-12-09 01:21:15,604 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-09 01:21:15,614 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,622 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 74 [2018-12-09 01:21:15,634 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 62 treesize of output 53 [2018-12-09 01:21:15,634 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,682 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:15,683 INFO L478 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-12-09 01:21:15,683 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,720 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 58 treesize of output 46 [2018-12-09 01:21:15,720 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:15,741 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-12-09 01:21:15,742 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,762 INFO L267 ElimStorePlain]: Start of recursive call 24: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:21:15,787 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:203, output treesize:23 [2018-12-09 01:21:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:15,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:15,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-12-09 01:21:15,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-09 01:21:15,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-09 01:21:15,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 01:21:15,887 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 35 states. [2018-12-09 01:21:17,532 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-12-09 01:21:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:18,031 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-12-09 01:21:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 01:21:18,031 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2018-12-09 01:21:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:18,031 INFO L225 Difference]: With dead ends: 136 [2018-12-09 01:21:18,031 INFO L226 Difference]: Without dead ends: 136 [2018-12-09 01:21:18,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=327, Invalid=2535, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 01:21:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-09 01:21:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2018-12-09 01:21:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 01:21:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2018-12-09 01:21:18,035 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 36 [2018-12-09 01:21:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:18,035 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2018-12-09 01:21:18,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-09 01:21:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-12-09 01:21:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 01:21:18,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:18,036 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:18,036 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:18,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -736245799, now seen corresponding path program 1 times [2018-12-09 01:21:18,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:21:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:18,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:21:18,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:21:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:21:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:21:18,090 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand 10 states. [2018-12-09 01:21:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:18,200 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-12-09 01:21:18,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:21:18,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-12-09 01:21:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:18,200 INFO L225 Difference]: With dead ends: 122 [2018-12-09 01:21:18,201 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 01:21:18,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:21:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 01:21:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-12-09 01:21:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 01:21:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2018-12-09 01:21:18,204 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 37 [2018-12-09 01:21:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:18,204 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2018-12-09 01:21:18,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:21:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2018-12-09 01:21:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:21:18,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:18,205 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:18,205 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:18,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1348783229, now seen corresponding path program 1 times [2018-12-09 01:21:18,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:18,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:21:18,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:18,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:21:18,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:21:18,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:21:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:21:18,229 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 5 states. [2018-12-09 01:21:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:18,282 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2018-12-09 01:21:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:21:18,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-09 01:21:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:18,284 INFO L225 Difference]: With dead ends: 130 [2018-12-09 01:21:18,284 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 01:21:18,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 01:21:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-12-09 01:21:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-09 01:21:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2018-12-09 01:21:18,288 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 38 [2018-12-09 01:21:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:18,288 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2018-12-09 01:21:18,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:21:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2018-12-09 01:21:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 01:21:18,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:18,289 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:18,289 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:18,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1132592664, now seen corresponding path program 1 times [2018-12-09 01:21:18,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:21:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:18,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 01:21:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:21:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:21:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:21:18,368 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 11 states. [2018-12-09 01:21:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:18,565 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-12-09 01:21:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 01:21:18,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-12-09 01:21:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:18,566 INFO L225 Difference]: With dead ends: 132 [2018-12-09 01:21:18,566 INFO L226 Difference]: Without dead ends: 132 [2018-12-09 01:21:18,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:21:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-09 01:21:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-12-09 01:21:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 01:21:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2018-12-09 01:21:18,569 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 39 [2018-12-09 01:21:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:18,569 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2018-12-09 01:21:18,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:21:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2018-12-09 01:21:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 01:21:18,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:18,570 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:18,570 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1137392924, now seen corresponding path program 1 times [2018-12-09 01:21:18,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:18,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:18,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:18,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:18,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:18,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:18,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:18,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:18,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:18,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:21:19,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:19,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:19,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:19,686 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 01:21:19,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-12-09 01:21:19,753 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 16 treesize of output 12 [2018-12-09 01:21:19,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-12-09 01:21:19,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-09 01:21:19,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:19,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 01:21:19,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:19,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 01:21:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:19,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:19,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-12-09 01:21:19,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 01:21:19,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 01:21:19,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=727, Unknown=3, NotChecked=0, Total=812 [2018-12-09 01:21:19,802 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 29 states. [2018-12-09 01:21:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:32,075 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-12-09 01:21:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 01:21:32,075 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-12-09 01:21:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:32,076 INFO L225 Difference]: With dead ends: 135 [2018-12-09 01:21:32,076 INFO L226 Difference]: Without dead ends: 135 [2018-12-09 01:21:32,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=1365, Unknown=3, NotChecked=0, Total=1560 [2018-12-09 01:21:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-09 01:21:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2018-12-09 01:21:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 01:21:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-12-09 01:21:32,079 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 39 [2018-12-09 01:21:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:32,079 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-12-09 01:21:32,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 01:21:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-12-09 01:21:32,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 01:21:32,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:32,079 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:32,080 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:32,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:32,080 INFO L82 PathProgramCache]: Analyzing trace with hash 750634279, now seen corresponding path program 1 times [2018-12-09 01:21:32,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:32,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:32,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:32,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:32,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:32,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:32,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:32,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:32,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:32,315 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 6 treesize of output 5 [2018-12-09 01:21:32,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:32,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:32,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-09 01:21:33,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:33,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:33,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:33,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 01:21:33,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2018-12-09 01:21:33,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-12-09 01:21:33,411 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 23 treesize of output 22 [2018-12-09 01:21:33,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:33,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-12-09 01:21:33,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 1 case distinctions, treesize of input 25 treesize of output 27 [2018-12-09 01:21:33,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 16 [2018-12-09 01:21:33,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,470 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 1 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 01:21:33,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:33,480 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 16 treesize of output 9 [2018-12-09 01:21:33,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:21:33,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:21:33,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-12-09 01:21:33,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:33,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 01:21:33,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:33,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:33,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-12-09 01:21:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:33,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:33,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-12-09 01:21:33,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 01:21:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 01:21:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=889, Unknown=3, NotChecked=0, Total=992 [2018-12-09 01:21:33,571 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 32 states. [2018-12-09 01:21:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:43,719 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2018-12-09 01:21:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 01:21:43,720 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-12-09 01:21:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:43,720 INFO L225 Difference]: With dead ends: 133 [2018-12-09 01:21:43,720 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 01:21:43,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=276, Invalid=1883, Unknown=3, NotChecked=0, Total=2162 [2018-12-09 01:21:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 01:21:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-12-09 01:21:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 01:21:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2018-12-09 01:21:43,723 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 40 [2018-12-09 01:21:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:43,723 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2018-12-09 01:21:43,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 01:21:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2018-12-09 01:21:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 01:21:43,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:43,724 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:43,724 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:43,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -564033654, now seen corresponding path program 2 times [2018-12-09 01:21:43,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:43,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:43,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:43,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:21:43,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:21:43,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:21:43,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:43,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:43,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 01:21:43,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:21:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:21:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:43,812 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 7 states. [2018-12-09 01:21:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:43,838 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-12-09 01:21:43,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:21:43,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-12-09 01:21:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:43,839 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:21:43,839 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 01:21:43,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:21:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 01:21:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-09 01:21:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 01:21:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-09 01:21:43,840 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 40 [2018-12-09 01:21:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:43,841 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-09 01:21:43,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:21:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-09 01:21:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 01:21:43,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:43,841 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:43,841 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:43,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1427946481, now seen corresponding path program 1 times [2018-12-09 01:21:43,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:43,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:43,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:21:43,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:21:43,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:43,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:21:43,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:21:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:21:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:21:43,859 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-12-09 01:21:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:43,908 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-12-09 01:21:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:21:43,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 01:21:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:43,909 INFO L225 Difference]: With dead ends: 71 [2018-12-09 01:21:43,909 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 01:21:43,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:21:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 01:21:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-09 01:21:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 01:21:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-12-09 01:21:43,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 44 [2018-12-09 01:21:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:43,911 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-12-09 01:21:43,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:21:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-12-09 01:21:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 01:21:43,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:43,911 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:43,911 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:43,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2132968081, now seen corresponding path program 1 times [2018-12-09 01:21:43,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:21:43,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:43,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:43,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:21:43,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:43,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 01:21:43,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:21:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:21:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:21:43,971 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 5 states. [2018-12-09 01:21:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:43,988 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-09 01:21:43,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:21:43,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 01:21:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:43,988 INFO L225 Difference]: With dead ends: 73 [2018-12-09 01:21:43,988 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 01:21:43,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 01:21:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-09 01:21:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 01:21:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-09 01:21:43,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 46 [2018-12-09 01:21:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:43,990 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-09 01:21:43,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:21:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-09 01:21:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 01:21:43,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:43,991 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:43,991 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:43,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1701092898, now seen corresponding path program 1 times [2018-12-09 01:21:43,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:44,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:44,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:44,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:44,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:44,629 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 6 treesize of output 5 [2018-12-09 01:21:44,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-12-09 01:21:44,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:44,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:44,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-12-09 01:21:44,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-09 01:21:44,706 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 13 treesize of output 10 [2018-12-09 01:21:44,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:44,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 01:21:44,739 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 19 treesize of output 14 [2018-12-09 01:21:44,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:44,741 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 14 treesize of output 23 [2018-12-09 01:21:44,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 01:21:44,779 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 45 treesize of output 41 [2018-12-09 01:21:44,781 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 14 treesize of output 13 [2018-12-09 01:21:44,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:44,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:44,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-12-09 01:21:45,125 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 25 treesize of output 21 [2018-12-09 01:21:45,126 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 21 treesize of output 13 [2018-12-09 01:21:45,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:45,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:45,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:45,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2018-12-09 01:21:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2018-12-09 01:21:45,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-09 01:21:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-09 01:21:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2029, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 01:21:45,205 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 47 states. [2018-12-09 01:21:46,597 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-12-09 01:21:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:47,454 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-09 01:21:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:21:47,455 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-09 01:21:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:47,455 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:21:47,455 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 01:21:47,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=479, Invalid=4777, Unknown=0, NotChecked=0, Total=5256 [2018-12-09 01:21:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 01:21:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-12-09 01:21:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 01:21:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-09 01:21:47,458 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 47 [2018-12-09 01:21:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:47,458 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-09 01:21:47,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-09 01:21:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-09 01:21:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 01:21:47,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:47,459 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:47,459 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:47,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash -163583187, now seen corresponding path program 1 times [2018-12-09 01:21:47,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:47,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:47,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:47,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:47,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:47,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:47,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:47,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:47,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:47,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:21:47,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:47,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:47,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:47,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 01:21:47,982 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 13 treesize of output 10 [2018-12-09 01:21:47,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:47,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:47,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-09 01:21:48,018 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 23 treesize of output 18 [2018-12-09 01:21:48,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:48,020 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 18 treesize of output 27 [2018-12-09 01:21:48,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:48,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:48,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:48,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-09 01:21:48,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-09 01:21:48,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-09 01:21:48,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:48,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:48,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:48,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-09 01:21:48,941 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-09 01:21:49,455 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 01:21:49,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:49,465 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 2 case distinctions, treesize of input 16 treesize of output 51 [2018-12-09 01:21:49,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:49,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:49,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:133 [2018-12-09 01:21:50,399 WARN L180 SmtUtils]: Spent 873.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 01:21:50,618 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-12-09 01:21:50,620 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 209 treesize of output 189 [2018-12-09 01:21:50,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 174 treesize of output 154 [2018-12-09 01:21:50,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:50,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:50,638 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 221 treesize of output 199 [2018-12-09 01:21:50,639 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 189 treesize of output 167 [2018-12-09 01:21:50,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:50,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:50,652 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 221 treesize of output 199 [2018-12-09 01:21:50,654 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 190 treesize of output 168 [2018-12-09 01:21:50,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:50,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:50,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:50,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:50,738 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 119 [2018-12-09 01:21:50,748 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 136 treesize of output 155 [2018-12-09 01:21:50,749 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:50,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 96 [2018-12-09 01:21:50,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:50,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:50,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:50,965 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 85 treesize of output 87 [2018-12-09 01:21:50,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 90 treesize of output 84 [2018-12-09 01:21:50,977 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:50,998 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:51,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,003 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 79 treesize of output 83 [2018-12-09 01:21:51,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2018-12-09 01:21:51,007 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,016 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 106 [2018-12-09 01:21:51,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-12-09 01:21:51,121 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,132 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 110 [2018-12-09 01:21:51,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 93 [2018-12-09 01:21:51,143 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,154 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 129 [2018-12-09 01:21:51,255 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,310 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 110 [2018-12-09 01:21:51,312 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,355 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,419 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 01:21:51,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 74 treesize of output 80 [2018-12-09 01:21:51,488 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:51,559 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 01:21:51,684 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-12-09 01:21:51,691 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 82 [2018-12-09 01:21:51,700 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 76 [2018-12-09 01:21:51,701 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:51,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,727 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 58 treesize of output 69 [2018-12-09 01:21:51,729 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 32 treesize of output 33 [2018-12-09 01:21:51,729 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:51,736 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:51,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,741 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 83 treesize of output 79 [2018-12-09 01:21:51,751 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 84 [2018-12-09 01:21:51,752 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-12-09 01:21:51,773 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:21:51,791 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 01:21:51,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2018-12-09 01:21:51,812 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 51 [2018-12-09 01:21:51,812 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:51,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 100 [2018-12-09 01:21:51,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-12-09 01:21:51,836 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,846 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:51,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 104 [2018-12-09 01:21:51,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 93 [2018-12-09 01:21:51,855 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,864 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:51,888 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:52,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 29 dim-0 vars, and 15 xjuncts. [2018-12-09 01:21:52,096 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 8 variables, input treesize:539, output treesize:1212 [2018-12-09 01:21:52,421 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 71 [2018-12-09 01:21:52,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:52,623 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 67 treesize of output 54 [2018-12-09 01:21:52,625 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 26 treesize of output 14 [2018-12-09 01:21:52,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:52,633 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 20 treesize of output 12 [2018-12-09 01:21:52,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:52,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:52,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 66 treesize of output 63 [2018-12-09 01:21:52,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 01:21:52,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,669 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 24 treesize of output 10 [2018-12-09 01:21:52,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:21:52,674 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,694 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 56 treesize of output 41 [2018-12-09 01:21:52,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:52,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 20 [2018-12-09 01:21:52,697 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-12-09 01:21:52,702 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,705 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:52,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 01:21:52,715 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:190, output treesize:43 [2018-12-09 01:21:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:52,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:52,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 43 [2018-12-09 01:21:52,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 01:21:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 01:21:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1770, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 01:21:52,793 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 44 states. [2018-12-09 01:21:54,022 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-09 01:21:54,713 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 92 [2018-12-09 01:21:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:55,345 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-09 01:21:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 01:21:55,345 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 48 [2018-12-09 01:21:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:55,346 INFO L225 Difference]: With dead ends: 92 [2018-12-09 01:21:55,346 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 01:21:55,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=308, Invalid=3598, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 01:21:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 01:21:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-12-09 01:21:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 01:21:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-09 01:21:55,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2018-12-09 01:21:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:55,349 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-09 01:21:55,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 01:21:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-09 01:21:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 01:21:55,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:55,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:55,350 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:55,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash -163583186, now seen corresponding path program 1 times [2018-12-09 01:21:55,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:55,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:55,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:55,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:55,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:55,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:55,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:21:55,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:21:55,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:55,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:55,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:55,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 01:21:55,850 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 13 treesize of output 10 [2018-12-09 01:21:55,851 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 10 treesize of output 9 [2018-12-09 01:21:55,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-09 01:21:55,877 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 23 treesize of output 18 [2018-12-09 01:21:55,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:55,879 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:55,879 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 18 treesize of output 36 [2018-12-09 01:21:55,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-09 01:21:55,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-09 01:21:55,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:21:55,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:55,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:55,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-09 01:21:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 01:21:56,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:21:56,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:56,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:56,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-12-09 01:21:56,830 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 22 treesize of output 21 [2018-12-09 01:21:56,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:56,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:56,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:56,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:47 [2018-12-09 01:21:57,063 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 89 treesize of output 79 [2018-12-09 01:21:57,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 79 treesize of output 69 [2018-12-09 01:21:57,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:57,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:57,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 76 [2018-12-09 01:21:57,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,220 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 64 treesize of output 50 [2018-12-09 01:21:57,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,286 INFO L478 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-12-09 01:21:57,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:57,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 66 [2018-12-09 01:21:57,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,351 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2018-12-09 01:21:57,450 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 23 treesize of output 19 [2018-12-09 01:21:57,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-09 01:21:57,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,457 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 26 treesize of output 20 [2018-12-09 01:21:57,458 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 20 treesize of output 11 [2018-12-09 01:21:57,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:57,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-12-09 01:21:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:57,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:21:57,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2018-12-09 01:21:57,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-09 01:21:57,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-09 01:21:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1699, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 01:21:57,510 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 43 states. [2018-12-09 01:21:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:58,981 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-12-09 01:21:58,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 01:21:58,982 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 48 [2018-12-09 01:21:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:58,982 INFO L225 Difference]: With dead ends: 102 [2018-12-09 01:21:58,982 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 01:21:58,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=340, Invalid=3950, Unknown=0, NotChecked=0, Total=4290 [2018-12-09 01:21:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 01:21:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2018-12-09 01:21:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 01:21:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-09 01:21:58,985 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 48 [2018-12-09 01:21:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:58,985 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-09 01:21:58,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-09 01:21:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-09 01:21:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 01:21:58,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:58,985 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:21:58,985 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:21:58,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:58,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1481141252, now seen corresponding path program 1 times [2018-12-09 01:21:58,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:21:58,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:21:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:59,913 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-09 01:22:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:00,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:00,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:00,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:00,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:00,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:22:00,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:22:00,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:00,660 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 10 treesize of output 9 [2018-12-09 01:22:00,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:00,671 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 10 treesize of output 9 [2018-12-09 01:22:00,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-09 01:22:00,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:22:00,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:00,723 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 18 treesize of output 27 [2018-12-09 01:22:00,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:22:00,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:00,741 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 18 treesize of output 27 [2018-12-09 01:22:00,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-12-09 01:22:00,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:00,906 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 34 treesize of output 35 [2018-12-09 01:22:00,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, 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 1 [2018-12-09 01:22:00,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:00,936 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 34 treesize of output 35 [2018-12-09 01:22:00,937 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 1 [2018-12-09 01:22:00,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:00,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:62 [2018-12-09 01:22:01,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 01:22:01,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:01,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,207 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 32 treesize of output 45 [2018-12-09 01:22:01,214 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 10 treesize of output 9 [2018-12-09 01:22:01,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:88, output treesize:92 [2018-12-09 01:22:01,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,644 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 71 treesize of output 66 [2018-12-09 01:22:01,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,660 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 44 treesize of output 57 [2018-12-09 01:22:01,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,729 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 53 treesize of output 58 [2018-12-09 01:22:01,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,732 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:01,732 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 18 treesize of output 36 [2018-12-09 01:22:01,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:110 [2018-12-09 01:22:01,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 144 [2018-12-09 01:22:01,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 53 [2018-12-09 01:22:01,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,876 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:01,878 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 74 treesize of output 66 [2018-12-09 01:22:01,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:01,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-12-09 01:22:01,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:01,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:01,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:175, output treesize:125 [2018-12-09 01:22:02,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:02,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:02,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:02,215 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-09 01:22:02,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:02,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:02,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:127 [2018-12-09 01:22:03,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 332 [2018-12-09 01:22:03,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,637 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:03,660 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 67 treesize of output 193 [2018-12-09 01:22:03,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 01:22:03,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 319 [2018-12-09 01:22:03,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 324 [2018-12-09 01:22:03,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:03,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:03,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 323 [2018-12-09 01:22:03,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 304 [2018-12-09 01:22:03,808 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:03,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:03,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:03,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 328 [2018-12-09 01:22:03,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 341 [2018-12-09 01:22:03,854 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:03,883 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:04,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 01:22:04,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 255 [2018-12-09 01:22:04,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,831 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-12-09 01:22:04,832 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,861 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 213 [2018-12-09 01:22:04,865 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 180 treesize of output 151 [2018-12-09 01:22:04,865 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,883 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,897 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,912 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 257 [2018-12-09 01:22:04,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,916 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-12-09 01:22:04,917 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,948 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 220 [2018-12-09 01:22:04,951 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 187 treesize of output 156 [2018-12-09 01:22:04,951 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,969 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,984 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:04,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:04,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 274 [2018-12-09 01:22:04,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:04,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,000 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:05,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 87 [2018-12-09 01:22:05,000 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,031 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:05,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 230 [2018-12-09 01:22:05,034 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 197 treesize of output 166 [2018-12-09 01:22:05,035 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,055 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,070 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-09 01:22:05,128 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 3 variables, input treesize:481, output treesize:499 [2018-12-09 01:22:05,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 190 treesize of output 173 [2018-12-09 01:22:05,849 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:05,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,851 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-12-09 01:22:05,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,874 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:05,874 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 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 01:22:05,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-12-09 01:22:05,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:05,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:05,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 176 [2018-12-09 01:22:05,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:05,959 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:05,959 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 0 case distinctions, treesize of input 28 treesize of output 25 [2018-12-09 01:22:05,959 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:05,986 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 25 treesize of output 13 [2018-12-09 01:22:05,986 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,002 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:06,002 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 34 treesize of output 27 [2018-12-09 01:22:06,003 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-12-09 01:22:06,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 8 [2018-12-09 01:22:06,050 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2018-12-09 01:22:06,067 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-09 01:22:06,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,078 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 22 treesize of output 12 [2018-12-09 01:22:06,078 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,083 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2018-12-09 01:22:06,107 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 7 [2018-12-09 01:22:06,107 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,120 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:06,120 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 30 treesize of output 19 [2018-12-09 01:22:06,121 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:06,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-12-09 01:22:06,135 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,142 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:06,153 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 11 variables, input treesize:385, output treesize:7 [2018-12-09 01:22:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:06,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:22:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 56 [2018-12-09 01:22:06,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-09 01:22:06,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-09 01:22:06,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2914, Unknown=1, NotChecked=0, Total=3080 [2018-12-09 01:22:06,230 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 56 states. [2018-12-09 01:22:08,062 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-09 01:22:08,960 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 113 [2018-12-09 01:22:09,740 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2018-12-09 01:22:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:10,138 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-12-09 01:22:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 01:22:10,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 51 [2018-12-09 01:22:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:10,138 INFO L225 Difference]: With dead ends: 92 [2018-12-09 01:22:10,138 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 01:22:10,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=439, Invalid=6532, Unknown=1, NotChecked=0, Total=6972 [2018-12-09 01:22:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 01:22:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-12-09 01:22:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 01:22:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-12-09 01:22:10,141 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 51 [2018-12-09 01:22:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:10,141 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-09 01:22:10,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-09 01:22:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-12-09 01:22:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 01:22:10,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:10,141 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 01:22:10,141 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:10,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:10,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1329256457, now seen corresponding path program 1 times [2018-12-09 01:22:10,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:22:10,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:22:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:10,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:10,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:10,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:10,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:22:10,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:22:10,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:22:10,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-09 01:22:10,584 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 13 treesize of output 10 [2018-12-09 01:22:10,585 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 10 treesize of output 9 [2018-12-09 01:22:10,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-09 01:22:10,612 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 23 treesize of output 18 [2018-12-09 01:22:10,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,614 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:10,615 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 18 treesize of output 36 [2018-12-09 01:22:10,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 01:22:10,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-09 01:22:10,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:22:10,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:10,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-09 01:22:10,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-12-09 01:22:10,874 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 22 treesize of output 21 [2018-12-09 01:22:10,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 01:22:10,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 52 treesize of output 44 [2018-12-09 01:22:10,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 36 [2018-12-09 01:22:10,902 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:10,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:10,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2018-12-09 01:22:10,923 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 41 treesize of output 37 [2018-12-09 01:22:10,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:10,954 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 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-09 01:22:10,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:10,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,977 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:10,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:10,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-12-09 01:22:10,978 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:11,004 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 18 treesize of output 15 [2018-12-09 01:22:11,004 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,014 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:69, output treesize:11 [2018-12-09 01:22:11,077 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 15 treesize of output 11 [2018-12-09 01:22:11,078 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 11 treesize of output 3 [2018-12-09 01:22:11,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:11,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 01:22:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:22:11,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 39 [2018-12-09 01:22:11,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-09 01:22:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-09 01:22:11,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 01:22:11,100 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 40 states. [2018-12-09 01:22:11,920 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-12-09 01:22:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:13,086 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-09 01:22:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 01:22:13,086 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-12-09 01:22:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:13,086 INFO L225 Difference]: With dead ends: 116 [2018-12-09 01:22:13,086 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 01:22:13,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=483, Invalid=4487, Unknown=0, NotChecked=0, Total=4970 [2018-12-09 01:22:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 01:22:13,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2018-12-09 01:22:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 01:22:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-12-09 01:22:13,089 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 52 [2018-12-09 01:22:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:13,089 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-12-09 01:22:13,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-09 01:22:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-12-09 01:22:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 01:22:13,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:13,089 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] [2018-12-09 01:22:13,090 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:13,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1810166342, now seen corresponding path program 1 times [2018-12-09 01:22:13,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:22:13,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:22:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:13,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:14,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:14,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:14,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:14,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:14,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:22:14,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:22:14,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:22:14,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,149 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 01:22:14,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-09 01:22:14,161 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 23 treesize of output 34 [2018-12-09 01:22:14,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,167 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,176 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-09 01:22:14,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 01:22:14,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:22:14,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 01:22:14,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:22:14,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:35 [2018-12-09 01:22:14,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 78 [2018-12-09 01:22:14,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-12-09 01:22:14,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:22:14,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:45 [2018-12-09 01:22:14,704 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 29 treesize of output 25 [2018-12-09 01:22:14,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 01:22:14,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,717 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 28 treesize of output 24 [2018-12-09 01:22:14,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 4 [2018-12-09 01:22:14,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,729 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 17 treesize of output 15 [2018-12-09 01:22:14,730 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 5 treesize of output 1 [2018-12-09 01:22:14,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,732 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,739 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 18 treesize of output 16 [2018-12-09 01:22:14,742 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 5 treesize of output 1 [2018-12-09 01:22:14,742 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:22:14,750 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:58, output treesize:22 [2018-12-09 01:22:14,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 01:22:14,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 01:22:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:14,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:22:14,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 40 [2018-12-09 01:22:14,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-09 01:22:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-09 01:22:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 01:22:14,864 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 41 states. [2018-12-09 01:22:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:25,665 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-12-09 01:22:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 01:22:25,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-12-09 01:22:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:25,666 INFO L225 Difference]: With dead ends: 129 [2018-12-09 01:22:25,666 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 01:22:25,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=604, Invalid=4083, Unknown=5, NotChecked=0, Total=4692 [2018-12-09 01:22:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 01:22:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2018-12-09 01:22:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 01:22:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2018-12-09 01:22:25,669 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 54 [2018-12-09 01:22:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:25,669 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-12-09 01:22:25,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-09 01:22:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2018-12-09 01:22:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 01:22:25,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:25,669 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] [2018-12-09 01:22:25,669 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:25,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 425878579, now seen corresponding path program 1 times [2018-12-09 01:22:25,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:22:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:22:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:26,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:26,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:26,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2018-12-09 01:22:27,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:27,095 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 10 treesize of output 9 [2018-12-09 01:22:27,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-09 01:22:27,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:22:27,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:27,153 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 18 treesize of output 27 [2018-12-09 01:22:27,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-09 01:22:27,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:27,281 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 79 [2018-12-09 01:22:27,284 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 16 treesize of output 15 [2018-12-09 01:22:27,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:27,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:65 [2018-12-09 01:22:28,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 162 [2018-12-09 01:22:28,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:22:28,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 176 [2018-12-09 01:22:28,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 01:22:28,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:22:28,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:345, output treesize:351 [2018-12-09 01:22:28,898 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-12-09 01:22:28,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 211 [2018-12-09 01:22:28,935 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 40 treesize of output 67 [2018-12-09 01:22:28,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:22:29,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 189 [2018-12-09 01:22:29,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 180 [2018-12-09 01:22:29,035 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:29,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 189 [2018-12-09 01:22:29,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 161 [2018-12-09 01:22:29,118 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:22:29,596 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 156 treesize of output 140 [2018-12-09 01:22:29,602 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 116 [2018-12-09 01:22:29,603 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,677 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,684 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 148 treesize of output 134 [2018-12-09 01:22:29,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 101 [2018-12-09 01:22:29,693 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,775 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,936 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 251 treesize of output 231 [2018-12-09 01:22:29,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 195 [2018-12-09 01:22:29,939 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:29,968 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 173 [2018-12-09 01:22:30,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 59 [2018-12-09 01:22:30,097 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-09 01:22:30,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 143 [2018-12-09 01:22:30,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 130 [2018-12-09 01:22:30,134 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,148 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 143 [2018-12-09 01:22:30,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 115 [2018-12-09 01:22:30,161 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,175 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,207 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:22:30,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-12-09 01:22:30,330 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:611, output treesize:463 [2018-12-09 01:22:30,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:30,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 109 [2018-12-09 01:22:30,696 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 31 treesize of output 23 [2018-12-09 01:22:30,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:30,707 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 11 treesize of output 1 [2018-12-09 01:22:30,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:30,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2018-12-09 01:22:30,716 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,730 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 7 treesize of output 5 [2018-12-09 01:22:30,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:30,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:30,737 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:120, output treesize:44 [2018-12-09 01:22:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:22:40,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:22:40,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 53 [2018-12-09 01:22:40,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 01:22:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 01:22:40,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2693, Unknown=7, NotChecked=0, Total=2862 [2018-12-09 01:22:40,103 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 54 states. [2018-12-09 01:22:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:54,588 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2018-12-09 01:22:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 01:22:54,588 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 61 [2018-12-09 01:22:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:54,589 INFO L225 Difference]: With dead ends: 127 [2018-12-09 01:22:54,589 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 01:22:54,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=333, Invalid=4916, Unknown=7, NotChecked=0, Total=5256 [2018-12-09 01:22:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 01:22:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-09 01:22:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 01:22:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2018-12-09 01:22:54,592 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 61 [2018-12-09 01:22:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:54,593 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2018-12-09 01:22:54,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 01:22:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2018-12-09 01:22:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 01:22:54,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:54,593 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-12-09 01:22:54,594 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:54,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 320925888, now seen corresponding path program 1 times [2018-12-09 01:22:54,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:22:54,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:22:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:54,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:54,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:22:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 01:22:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:54,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:22:54,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:22:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:22:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:22:54,625 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 6 states. [2018-12-09 01:22:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:54,645 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2018-12-09 01:22:54,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:22:54,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 01:22:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:54,645 INFO L225 Difference]: With dead ends: 58 [2018-12-09 01:22:54,645 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:22:54,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:22:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:22:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:22:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:22:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:22:54,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-12-09 01:22:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:54,646 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:22:54,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:22:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:22:54,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:22:54,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:22:54 BoogieIcfgContainer [2018-12-09 01:22:54,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:22:54,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:22:54,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:22:54,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:22:54,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:21:00" (3/4) ... [2018-12-09 01:22:54,655 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:22:54,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:22:54,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-09 01:22:54,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-12-09 01:22:54,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 01:22:54,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 01:22:54,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:22:54,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-09 01:22:54,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2018-12-09 01:22:54,667 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 01:22:54,667 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 01:22:54,668 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 01:22:54,702 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1fb1c789-3716-4b11-99da-d5df236dedbb/bin-2019/uautomizer/witness.graphml [2018-12-09 01:22:54,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:22:54,703 INFO L168 Benchmark]: Toolchain (without parser) took 114433.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 957.1 MB in the beginning and 867.9 MB in the end (delta: 89.2 MB). Peak memory consumption was 344.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:54,703 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:22:54,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:54,703 INFO L168 Benchmark]: Boogie Preprocessor took 29.84 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:54,703 INFO L168 Benchmark]: RCFGBuilder took 288.55 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: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:54,704 INFO L168 Benchmark]: TraceAbstraction took 113798.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 877.0 MB in the end (delta: 194.0 MB). Peak memory consumption was 304.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:54,704 INFO L168 Benchmark]: Witness Printer took 51.75 ms. Allocated memory is still 1.3 GB. Free memory was 877.0 MB in the beginning and 867.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:54,705 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.84 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 288.55 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: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113798.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.1 GB in the beginning and 877.0 MB in the end (delta: 194.0 MB). Peak memory consumption was 304.7 MB. Max. memory is 11.5 GB. * Witness Printer took 51.75 ms. Allocated memory is still 1.3 GB. Free memory was 877.0 MB in the beginning and 867.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: 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: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 91 locations, 29 error locations. SAFE Result, 113.7s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 73.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1253 SDtfs, 2725 SDslu, 7750 SDs, 0 SdLazy, 16743 SolverSat, 648 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 45.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 579 SyntacticMatches, 43 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9111 ImplicationChecksByTransitivity, 55.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=18, 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.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 262 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 1894 NumberOfCodeBlocks, 1894 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1843 ConstructedInterpolants, 203 QuantifiedInterpolants, 1612681 SizeOfPredicates, 259 NumberOfNonLiveVariables, 4343 ConjunctsInSsa, 833 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 180/554 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...