./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_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_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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 082b1bde50b1883aaa9112842176e8bb0db36577 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:48:14,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:48:14,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:48:14,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:48:14,423 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:48:14,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:48:14,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:48:14,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:48:14,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:48:14,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:48:14,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:48:14,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:48:14,427 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:48:14,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:48:14,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:48:14,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:48:14,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:48:14,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:48:14,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:48:14,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:48:14,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:48:14,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:48:14,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:48:14,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:48:14,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:48:14,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:48:14,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:48:14,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:48:14,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:48:14,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:48:14,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:48:14,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:48:14,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:48:14,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:48:14,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:48:14,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:48:14,438 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 17:48:14,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:48:14,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:48:14,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:48:14,449 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:48:14,450 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:48:14,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:48:14,450 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 17:48:14,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:48:14,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:48:14,450 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:48:14,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:48:14,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:48:14,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:48:14,451 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 17:48:14,451 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 17:48:14,451 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 17:48:14,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:48:14,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:48:14,452 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:48:14,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:48:14,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:48:14,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:48:14,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:48:14,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:48:14,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:48:14,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:48:14,453 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 17:48:14,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:48:14,453 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_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2018-12-08 17:48:14,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:48:14,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:48:14,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:48:14,485 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:48:14,485 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:48:14,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:48:14,525 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/data/d3159b8cc/ba3e8c8b1c58407bb8f09a074404f2d4/FLAG1095f4e2a [2018-12-08 17:48:14,888 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:48:14,888 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/sv-benchmarks/c/list-simple/sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:48:14,894 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/data/d3159b8cc/ba3e8c8b1c58407bb8f09a074404f2d4/FLAG1095f4e2a [2018-12-08 17:48:14,904 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/data/d3159b8cc/ba3e8c8b1c58407bb8f09a074404f2d4 [2018-12-08 17:48:14,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:48:14,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 17:48:14,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:48:14,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:48:14,912 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:48:14,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:48:14" (1/1) ... [2018-12-08 17:48:14,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4e54bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:14, skipping insertion in model container [2018-12-08 17:48:14,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:48:14" (1/1) ... [2018-12-08 17:48:14,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:48:14,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:48:15,111 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:48:15,148 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:48:15,172 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:48:15,194 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:48:15,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15 WrapperNode [2018-12-08 17:48:15,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:48:15,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:48:15,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:48:15,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:48:15,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... [2018-12-08 17:48:15,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:48:15,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:48:15,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:48:15,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:48:15,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 17:48:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-08 17:48:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_remove_first [2018-12-08 17:48:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 17:48:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 17:48:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 17:48:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 17:48:15,260 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 17:48:15,261 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 17:48:15,262 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:48:15,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_remove_first [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:48:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:48:15,572 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:48:15,573 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-08 17:48:15,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:48:15 BoogieIcfgContainer [2018-12-08 17:48:15,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:48:15,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:48:15,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:48:15,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:48:15,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:48:14" (1/3) ... [2018-12-08 17:48:15,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2ffdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:48:15, skipping insertion in model container [2018-12-08 17:48:15,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:48:15" (2/3) ... [2018-12-08 17:48:15,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2ffdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:48:15, skipping insertion in model container [2018-12-08 17:48:15,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:48:15" (3/3) ... [2018-12-08 17:48:15,578 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:48:15,583 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:48:15,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-08 17:48:15,596 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-08 17:48:15,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:48:15,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:48:15,611 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 17:48:15,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:48:15,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:48:15,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:48:15,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:48:15,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:48:15,611 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:48:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-12-08 17:48:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 17:48:15,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:15,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:48:15,628 INFO L423 AbstractCegarLoop]: === Iteration 1 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 926435682, now seen corresponding path program 1 times [2018-12-08 17:48:15,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:15,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:15,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:15,733 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-08 17:48:15,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:15,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:48:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:48:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:48:15,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:48:15,746 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2018-12-08 17:48:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:15,829 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-12-08 17:48:15,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:48:15,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 17:48:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:15,836 INFO L225 Difference]: With dead ends: 101 [2018-12-08 17:48:15,836 INFO L226 Difference]: Without dead ends: 94 [2018-12-08 17:48:15,837 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-08 17:48:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-08 17:48:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-08 17:48:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-08 17:48:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-12-08 17:48:15,861 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2018-12-08 17:48:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:15,861 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-12-08 17:48:15,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:48:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-12-08 17:48:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 17:48:15,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:15,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:48:15,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:15,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 926435683, now seen corresponding path program 1 times [2018-12-08 17:48:15,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:15,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:15,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:15,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:15,903 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-08 17:48:15,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:15,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:48:15,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:48:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:48:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:48:15,905 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 3 states. [2018-12-08 17:48:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:15,959 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-08 17:48:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:48:15,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 17:48:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:15,961 INFO L225 Difference]: With dead ends: 92 [2018-12-08 17:48:15,961 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 17:48:15,961 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-08 17:48:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 17:48:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-08 17:48:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 17:48:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-12-08 17:48:15,966 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 12 [2018-12-08 17:48:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:15,966 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-12-08 17:48:15,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:48:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-12-08 17:48:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:48:15,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:15,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:48:15,967 INFO L423 AbstractCegarLoop]: === Iteration 3 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:15,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 694828250, now seen corresponding path program 1 times [2018-12-08 17:48:15,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:15,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:16,005 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-08 17:48:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:48:16,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:48:16,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:48:16,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:48:16,006 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2018-12-08 17:48:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:16,138 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-12-08 17:48:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:48:16,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-08 17:48:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:16,141 INFO L225 Difference]: With dead ends: 96 [2018-12-08 17:48:16,141 INFO L226 Difference]: Without dead ends: 96 [2018-12-08 17:48:16,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:48:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-08 17:48:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-08 17:48:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-08 17:48:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-12-08 17:48:16,148 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 19 [2018-12-08 17:48:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:16,149 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-12-08 17:48:16,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:48:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-12-08 17:48:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:48:16,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:16,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:48:16,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:16,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash 694828251, now seen corresponding path program 1 times [2018-12-08 17:48:16,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:16,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:16,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:16,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:16,184 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-08 17:48:16,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:16,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:48:16,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:48:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:48:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:48:16,185 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 5 states. [2018-12-08 17:48:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:16,206 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-12-08 17:48:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:48:16,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-08 17:48:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:16,207 INFO L225 Difference]: With dead ends: 93 [2018-12-08 17:48:16,207 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 17:48:16,207 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-08 17:48:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 17:48:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-08 17:48:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 17:48:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-12-08 17:48:16,210 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 19 [2018-12-08 17:48:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:16,211 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-12-08 17:48:16,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:48:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-12-08 17:48:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:48:16,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:16,211 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] [2018-12-08 17:48:16,212 INFO L423 AbstractCegarLoop]: === Iteration 5 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:16,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash 32148750, now seen corresponding path program 1 times [2018-12-08 17:48:16,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:16,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:16,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:16,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:48:16,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:16,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:48:16,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:48:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:48:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:48:16,272 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 6 states. [2018-12-08 17:48:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:16,372 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-08 17:48:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:48:16,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 17:48:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:16,373 INFO L225 Difference]: With dead ends: 93 [2018-12-08 17:48:16,373 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 17:48:16,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:48:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 17:48:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-08 17:48:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 17:48:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-12-08 17:48:16,376 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 28 [2018-12-08 17:48:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:16,376 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-12-08 17:48:16,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:48:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-12-08 17:48:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 17:48:16,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:16,377 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] [2018-12-08 17:48:16,377 INFO L423 AbstractCegarLoop]: === Iteration 6 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:16,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash 32148751, now seen corresponding path program 1 times [2018-12-08 17:48:16,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:16,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:16,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:16,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:48:16,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:16,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:48:16,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:48:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:48:16,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:48:16,422 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2018-12-08 17:48:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:16,546 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-12-08 17:48:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:48:16,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-08 17:48:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:16,547 INFO L225 Difference]: With dead ends: 92 [2018-12-08 17:48:16,547 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 17:48:16,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:48:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 17:48:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-12-08 17:48:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 17:48:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-12-08 17:48:16,551 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 28 [2018-12-08 17:48:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:16,551 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-08 17:48:16,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:48:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-12-08 17:48:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 17:48:16,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:16,552 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] [2018-12-08 17:48:16,552 INFO L423 AbstractCegarLoop]: === Iteration 7 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:16,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -34254296, now seen corresponding path program 1 times [2018-12-08 17:48:16,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:16,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:48:16,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:48:16,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:48:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:16,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:48:17,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:48:17,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:17,893 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-08 17:48:17,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-08 17:48:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:48:17,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:48:17,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-08 17:48:17,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:48:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:48:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2018-12-08 17:48:17,925 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 12 states. [2018-12-08 17:48:18,244 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-08 17:48:18,511 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-08 17:48:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:18,644 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-12-08 17:48:18,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:48:18,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-08 17:48:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:18,645 INFO L225 Difference]: With dead ends: 91 [2018-12-08 17:48:18,645 INFO L226 Difference]: Without dead ends: 91 [2018-12-08 17:48:18,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2018-12-08 17:48:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-08 17:48:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-08 17:48:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 17:48:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-08 17:48:18,649 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 31 [2018-12-08 17:48:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:18,649 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-08 17:48:18,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:48:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-08 17:48:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 17:48:18,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:18,650 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] [2018-12-08 17:48:18,650 INFO L423 AbstractCegarLoop]: === Iteration 8 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:18,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash -34254295, now seen corresponding path program 1 times [2018-12-08 17:48:18,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:18,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:18,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:18,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:48:18,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:48:18,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:48:18,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:18,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:48:18,783 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-08 17:48:18,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:18,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:48:18,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 17:48:19,108 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 8))) is different from true [2018-12-08 17:48:19,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, 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 14 [2018-12-08 17:48:19,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:19,120 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-08 17:48:19,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-12-08 17:48:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2018-12-08 17:48:19,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:48:19,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-12-08 17:48:19,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:48:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:48:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2018-12-08 17:48:19,145 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 14 states. [2018-12-08 17:48:19,690 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-08 17:48:20,236 WARN L180 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-12-08 17:48:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:20,464 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-12-08 17:48:20,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:48:20,464 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-12-08 17:48:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:20,465 INFO L225 Difference]: With dead ends: 90 [2018-12-08 17:48:20,465 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 17:48:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=218, Unknown=1, NotChecked=30, Total=306 [2018-12-08 17:48:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 17:48:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-08 17:48:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-08 17:48:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-12-08 17:48:20,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 31 [2018-12-08 17:48:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:20,467 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-12-08 17:48:20,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:48:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-12-08 17:48:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:48:20,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:20,468 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-08 17:48:20,468 INFO L423 AbstractCegarLoop]: === Iteration 9 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:20,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1270838546, now seen corresponding path program 1 times [2018-12-08 17:48:20,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:20,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:20,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:48:20,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:48:20,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:48:20,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:48:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:48:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:48:20,493 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-12-08 17:48:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:20,503 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-12-08 17:48:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:48:20,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-08 17:48:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:20,505 INFO L225 Difference]: With dead ends: 92 [2018-12-08 17:48:20,505 INFO L226 Difference]: Without dead ends: 92 [2018-12-08 17:48:20,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:48:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-08 17:48:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-08 17:48:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 17:48:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-12-08 17:48:20,507 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 37 [2018-12-08 17:48:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:20,508 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-12-08 17:48:20,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:48:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-12-08 17:48:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 17:48:20,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:20,509 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-08 17:48:20,509 INFO L423 AbstractCegarLoop]: === Iteration 10 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1505300450, now seen corresponding path program 1 times [2018-12-08 17:48:20,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:20,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:48:20,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:48:20,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:48:20,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:20,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:48:20,669 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-08 17:48:20,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:20,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:48:20,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 17:48:21,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:48:21,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:48:21,522 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-08 17:48:21,525 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-08 17:48:21,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:21,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:48:21,533 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-08 17:48:21,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-08 17:48:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:48:21,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:48:21,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-08 17:48:21,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 17:48:21,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 17:48:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=244, Unknown=3, NotChecked=0, Total=306 [2018-12-08 17:48:21,587 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 18 states. [2018-12-08 17:48:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:48:33,003 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-12-08 17:48:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:48:33,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-08 17:48:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:48:33,004 INFO L225 Difference]: With dead ends: 137 [2018-12-08 17:48:33,005 INFO L226 Difference]: Without dead ends: 137 [2018-12-08 17:48:33,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=422, Unknown=3, NotChecked=0, Total=552 [2018-12-08 17:48:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-08 17:48:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2018-12-08 17:48:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 17:48:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-08 17:48:33,007 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 39 [2018-12-08 17:48:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:48:33,008 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-08 17:48:33,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 17:48:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-08 17:48:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 17:48:33,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:48:33,008 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-08 17:48:33,008 INFO L423 AbstractCegarLoop]: === Iteration 11 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:48:33,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:48:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1505300451, now seen corresponding path program 1 times [2018-12-08 17:48:33,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:48:33,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:48:33,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:33,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:33,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:48:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:48:33,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:48:33,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:48:33,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:48:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:48:33,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:48:33,138 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-08 17:48:33,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:33,143 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-08 17:48:33,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:33,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:48:33,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 17:48:38,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:48:38,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:48:38,199 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-08 17:48:38,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:48:38,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:48:38,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-08 17:48:38,213 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 2 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 17:48:38,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 17:48:38,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:48:38,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:48:38,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:42 [2018-12-08 17:48:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:48:38,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:48:38,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-12-08 17:48:38,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 17:48:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 17:48:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2018-12-08 17:48:38,327 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 18 states. [2018-12-08 17:49:03,579 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-08 17:49:07,643 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-08 17:49:11,800 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-12-08 17:50:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:31,372 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-12-08 17:50:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:50:31,372 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-08 17:50:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:31,373 INFO L225 Difference]: With dead ends: 146 [2018-12-08 17:50:31,373 INFO L226 Difference]: Without dead ends: 146 [2018-12-08 17:50:31,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=117, Invalid=431, Unknown=4, NotChecked=0, Total=552 [2018-12-08 17:50:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-08 17:50:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2018-12-08 17:50:31,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-08 17:50:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2018-12-08 17:50:31,376 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 39 [2018-12-08 17:50:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:31,376 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2018-12-08 17:50:31,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 17:50:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2018-12-08 17:50:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:50:31,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:31,377 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-08 17:50:31,377 INFO L423 AbstractCegarLoop]: === Iteration 12 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:31,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -580326251, now seen corresponding path program 1 times [2018-12-08 17:50:31,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:50:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:31,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:50:31,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:50:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:50:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:50:31,448 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand 13 states. [2018-12-08 17:50:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:31,721 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2018-12-08 17:50:31,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:50:31,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-08 17:50:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:31,722 INFO L225 Difference]: With dead ends: 175 [2018-12-08 17:50:31,722 INFO L226 Difference]: Without dead ends: 175 [2018-12-08 17:50:31,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:50:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-08 17:50:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-12-08 17:50:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-08 17:50:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2018-12-08 17:50:31,725 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 40 [2018-12-08 17:50:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:31,725 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2018-12-08 17:50:31,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:50:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2018-12-08 17:50:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:50:31,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:31,726 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-08 17:50:31,726 INFO L423 AbstractCegarLoop]: === Iteration 13 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:31,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:31,726 INFO L82 PathProgramCache]: Analyzing trace with hash -580326250, now seen corresponding path program 1 times [2018-12-08 17:50:31,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:31,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:31,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:31,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:31,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:50:31,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:50:31,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:50:31,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:50:31,827 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 13 states. [2018-12-08 17:50:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:32,110 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-12-08 17:50:32,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:50:32,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-12-08 17:50:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:32,111 INFO L225 Difference]: With dead ends: 178 [2018-12-08 17:50:32,111 INFO L226 Difference]: Without dead ends: 178 [2018-12-08 17:50:32,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:50:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-08 17:50:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2018-12-08 17:50:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-08 17:50:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2018-12-08 17:50:32,114 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 40 [2018-12-08 17:50:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:32,114 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-12-08 17:50:32,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:50:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2018-12-08 17:50:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 17:50:32,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:32,115 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] [2018-12-08 17:50:32,115 INFO L423 AbstractCegarLoop]: === Iteration 14 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:32,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -52836852, now seen corresponding path program 1 times [2018-12-08 17:50:32,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:32,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:50:32,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:50:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:50:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:50:32,182 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2018-12-08 17:50:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:32,392 INFO L93 Difference]: Finished difference Result 204 states and 255 transitions. [2018-12-08 17:50:32,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:50:32,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-12-08 17:50:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:32,393 INFO L225 Difference]: With dead ends: 204 [2018-12-08 17:50:32,393 INFO L226 Difference]: Without dead ends: 204 [2018-12-08 17:50:32,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:50:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-08 17:50:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2018-12-08 17:50:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-08 17:50:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2018-12-08 17:50:32,397 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 45 [2018-12-08 17:50:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2018-12-08 17:50:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:50:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2018-12-08 17:50:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:50:32,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:32,397 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-08 17:50:32,397 INFO L423 AbstractCegarLoop]: === Iteration 15 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:32,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1637572900, now seen corresponding path program 1 times [2018-12-08 17:50:32,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:50:32,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:50:32,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:50:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:50:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:50:32,421 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand 6 states. [2018-12-08 17:50:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:32,516 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2018-12-08 17:50:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:50:32,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-08 17:50:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:32,518 INFO L225 Difference]: With dead ends: 167 [2018-12-08 17:50:32,518 INFO L226 Difference]: Without dead ends: 167 [2018-12-08 17:50:32,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:50:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-08 17:50:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-08 17:50:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-08 17:50:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2018-12-08 17:50:32,522 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 46 [2018-12-08 17:50:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:32,522 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2018-12-08 17:50:32,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:50:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2018-12-08 17:50:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:50:32,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:32,523 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-08 17:50:32,523 INFO L423 AbstractCegarLoop]: === Iteration 16 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:32,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1637572899, now seen corresponding path program 1 times [2018-12-08 17:50:32,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:32,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:32,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:32,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:32,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 17:50:32,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 17:50:32,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 17:50:32,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:50:32,687 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand 15 states. [2018-12-08 17:50:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:33,099 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2018-12-08 17:50:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:50:33,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-12-08 17:50:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:33,101 INFO L225 Difference]: With dead ends: 239 [2018-12-08 17:50:33,101 INFO L226 Difference]: Without dead ends: 239 [2018-12-08 17:50:33,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:50:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-08 17:50:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2018-12-08 17:50:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-08 17:50:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 264 transitions. [2018-12-08 17:50:33,107 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 264 transitions. Word has length 46 [2018-12-08 17:50:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:33,107 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 264 transitions. [2018-12-08 17:50:33,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 17:50:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 264 transitions. [2018-12-08 17:50:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:50:33,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:33,108 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-08 17:50:33,108 INFO L423 AbstractCegarLoop]: === Iteration 17 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:33,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1637942281, now seen corresponding path program 1 times [2018-12-08 17:50:33,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:50:33,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:33,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:50:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:50:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:50:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:50:33,138 INFO L87 Difference]: Start difference. First operand 198 states and 264 transitions. Second operand 5 states. [2018-12-08 17:50:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:33,209 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2018-12-08 17:50:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:50:33,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 17:50:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:33,210 INFO L225 Difference]: With dead ends: 197 [2018-12-08 17:50:33,210 INFO L226 Difference]: Without dead ends: 197 [2018-12-08 17:50:33,210 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-08 17:50:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-08 17:50:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-08 17:50:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-08 17:50:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2018-12-08 17:50:33,214 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 46 [2018-12-08 17:50:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:33,214 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2018-12-08 17:50:33,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:50:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2018-12-08 17:50:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:50:33,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:33,215 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, 1] [2018-12-08 17:50:33,215 INFO L423 AbstractCegarLoop]: === Iteration 18 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:33,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash 763396975, now seen corresponding path program 1 times [2018-12-08 17:50:33,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:33,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:33,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:33,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:33,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:33,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:33,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:33,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:33,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:33,416 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-08 17:50:33,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:50:33,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:33,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:33,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:33,741 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-08 17:50:33,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,745 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-08 17:50:33,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-12-08 17:50:33,823 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-08 17:50:33,824 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-08 17:50:33,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-08 17:50:33,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:33,831 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-08 17:50:33,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:33,835 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-08 17:50:33,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 17:50:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:33,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:33,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2018-12-08 17:50:33,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 17:50:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 17:50:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 17:50:33,872 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand 33 states. [2018-12-08 17:50:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:37,585 INFO L93 Difference]: Finished difference Result 217 states and 281 transitions. [2018-12-08 17:50:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 17:50:37,585 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-08 17:50:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:37,586 INFO L225 Difference]: With dead ends: 217 [2018-12-08 17:50:37,586 INFO L226 Difference]: Without dead ends: 217 [2018-12-08 17:50:37,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 17:50:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-08 17:50:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2018-12-08 17:50:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-08 17:50:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2018-12-08 17:50:37,590 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 47 [2018-12-08 17:50:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:37,590 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2018-12-08 17:50:37,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 17:50:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2018-12-08 17:50:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 17:50:37,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:37,590 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:37,591 INFO L423 AbstractCegarLoop]: === Iteration 19 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:37,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash -578653648, now seen corresponding path program 2 times [2018-12-08 17:50:37,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:37,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:37,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:37,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:37,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 17:50:37,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:37,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 17:50:37,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:50:37,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:50:37,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 17:50:37,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:37,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 17:50:37,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:50:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:50:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:50:37,675 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand 6 states. [2018-12-08 17:50:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:37,709 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-12-08 17:50:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:50:37,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-08 17:50:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:37,710 INFO L225 Difference]: With dead ends: 126 [2018-12-08 17:50:37,710 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 17:50:37,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-08 17:50:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 17:50:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-08 17:50:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-08 17:50:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2018-12-08 17:50:37,714 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 51 [2018-12-08 17:50:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:37,714 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2018-12-08 17:50:37,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:50:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2018-12-08 17:50:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 17:50:37,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:37,715 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, 1, 1, 1, 1, 1] [2018-12-08 17:50:37,715 INFO L423 AbstractCegarLoop]: === Iteration 20 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:37,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -633588376, now seen corresponding path program 1 times [2018-12-08 17:50:37,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:37,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:37,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:50:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:50:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:50:37,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:50:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:50:37,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:50:37,811 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand 11 states. [2018-12-08 17:50:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:38,020 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-12-08 17:50:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:50:38,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-12-08 17:50:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:38,020 INFO L225 Difference]: With dead ends: 116 [2018-12-08 17:50:38,020 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 17:50:38,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:50:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 17:50:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-12-08 17:50:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-08 17:50:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-12-08 17:50:38,024 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 51 [2018-12-08 17:50:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:38,024 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-12-08 17:50:38,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:50:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-12-08 17:50:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 17:50:38,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:38,025 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, 1, 1, 1, 1, 1] [2018-12-08 17:50:38,025 INFO L423 AbstractCegarLoop]: === Iteration 21 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:38,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -633535761, now seen corresponding path program 1 times [2018-12-08 17:50:38,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:38,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:38,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:38,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:38,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:38,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:38,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:38,362 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-08 17:50:38,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 17:50:38,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:38,379 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-08 17:50:38,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-08 17:50:38,412 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 37 treesize of output 33 [2018-12-08 17:50:38,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:50:38,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,421 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-08 17:50:38,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-12-08 17:50:38,619 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 68 treesize of output 60 [2018-12-08 17:50:38,620 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 60 treesize of output 49 [2018-12-08 17:50:38,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,629 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-08 17:50:38,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2018-12-08 17:50:38,714 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 60 treesize of output 49 [2018-12-08 17:50:38,716 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 38 treesize of output 29 [2018-12-08 17:50:38,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,737 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 29 treesize of output 22 [2018-12-08 17:50:38,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,758 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 32 treesize of output 25 [2018-12-08 17:50:38,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,777 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 28 treesize of output 21 [2018-12-08 17:50:38,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-08 17:50:38,797 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,815 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 34 treesize of output 25 [2018-12-08 17:50:38,815 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,832 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 22 treesize of output 18 [2018-12-08 17:50:38,833 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,846 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 19 treesize of output 13 [2018-12-08 17:50:38,846 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:38,850 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-08 17:50:38,850 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:60, output treesize:5 [2018-12-08 17:50:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:38,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:38,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2018-12-08 17:50:38,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-08 17:50:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-08 17:50:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1045, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 17:50:38,885 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 34 states. [2018-12-08 17:50:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:39,983 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-12-08 17:50:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 17:50:39,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2018-12-08 17:50:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:39,984 INFO L225 Difference]: With dead ends: 125 [2018-12-08 17:50:39,984 INFO L226 Difference]: Without dead ends: 125 [2018-12-08 17:50:39,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=2238, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 17:50:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-08 17:50:39,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2018-12-08 17:50:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-08 17:50:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-12-08 17:50:39,986 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 51 [2018-12-08 17:50:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:39,986 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-12-08 17:50:39,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-08 17:50:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-12-08 17:50:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 17:50:39,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:39,987 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, 1, 1, 1, 1, 1] [2018-12-08 17:50:39,987 INFO L423 AbstractCegarLoop]: === Iteration 22 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:39,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -633535760, now seen corresponding path program 1 times [2018-12-08 17:50:39,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:39,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:39,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:40,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:40,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:40,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:40,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:40,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:40,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:50:40,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 17:50:40,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-12-08 17:50:40,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:40,751 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-08 17:50:40,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:40,766 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-08 17:50:40,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,776 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-08 17:50:40,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-12-08 17:50:40,869 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 62 treesize of output 58 [2018-12-08 17:50:40,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:50:40,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-12-08 17:50:40,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:50:40,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:40,908 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-08 17:50:40,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:71 [2018-12-08 17:50:41,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:41,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:41,711 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 1 case distinctions, treesize of input 167 treesize of output 138 [2018-12-08 17:50:41,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 122 [2018-12-08 17:50:41,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2018-12-08 17:50:41,743 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,766 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 118 treesize of output 91 [2018-12-08 17:50:41,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,791 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 94 treesize of output 76 [2018-12-08 17:50:41,792 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-08 17:50:41,813 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 91 treesize of output 77 [2018-12-08 17:50:41,814 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-08 17:50:41,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:50:41,864 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 91 treesize of output 67 [2018-12-08 17:50:41,865 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 33 treesize of output 14 [2018-12-08 17:50:41,866 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,876 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-08 17:50:41,877 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,886 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-08 17:50:41,887 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,893 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,900 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 87 treesize of output 71 [2018-12-08 17:50:41,902 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 67 treesize of output 60 [2018-12-08 17:50:41,902 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,927 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 60 treesize of output 48 [2018-12-08 17:50:41,928 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-08 17:50:41,957 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 48 treesize of output 37 [2018-12-08 17:50:41,957 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:41,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2018-12-08 17:50:41,981 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-08 17:50:42,001 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 44 treesize of output 33 [2018-12-08 17:50:42,001 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:42,023 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:50:42,042 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 2 xjuncts. [2018-12-08 17:50:42,042 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:181, output treesize:47 [2018-12-08 17:50:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:42,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:42,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2018-12-08 17:50:42,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-08 17:50:42,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-08 17:50:42,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2523, Unknown=0, NotChecked=0, Total=2652 [2018-12-08 17:50:42,181 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 52 states. [2018-12-08 17:50:44,220 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2018-12-08 17:50:44,705 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 86 [2018-12-08 17:50:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:46,046 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-12-08 17:50:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 17:50:46,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-08 17:50:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:46,048 INFO L225 Difference]: With dead ends: 138 [2018-12-08 17:50:46,048 INFO L226 Difference]: Without dead ends: 138 [2018-12-08 17:50:46,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=333, Invalid=5069, Unknown=0, NotChecked=0, Total=5402 [2018-12-08 17:50:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-08 17:50:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-08 17:50:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-08 17:50:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-12-08 17:50:46,053 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 51 [2018-12-08 17:50:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:46,054 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-12-08 17:50:46,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-08 17:50:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-12-08 17:50:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 17:50:46,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:46,055 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, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:46,055 INFO L423 AbstractCegarLoop]: === Iteration 23 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:46,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1855099592, now seen corresponding path program 1 times [2018-12-08 17:50:46,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:46,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:46,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:50:46,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:50:46,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:50:46,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:50:46,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:50:46,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:50:46,085 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 5 states. [2018-12-08 17:50:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:46,146 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2018-12-08 17:50:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:50:46,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-08 17:50:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:46,147 INFO L225 Difference]: With dead ends: 122 [2018-12-08 17:50:46,147 INFO L226 Difference]: Without dead ends: 122 [2018-12-08 17:50:46,147 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-08 17:50:46,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-08 17:50:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-08 17:50:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-08 17:50:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-08 17:50:46,150 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 52 [2018-12-08 17:50:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:46,151 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-08 17:50:46,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:50:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-08 17:50:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:50:46,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:46,151 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:46,151 INFO L423 AbstractCegarLoop]: === Iteration 24 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:46,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -339279462, now seen corresponding path program 1 times [2018-12-08 17:50:46,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:46,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:50:46,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:46,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:46,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:50:46,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:46,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-08 17:50:46,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:50:46,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:50:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:50:46,241 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-12-08 17:50:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:46,265 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2018-12-08 17:50:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:50:46,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-08 17:50:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:46,266 INFO L225 Difference]: With dead ends: 130 [2018-12-08 17:50:46,266 INFO L226 Difference]: Without dead ends: 130 [2018-12-08 17:50:46,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:50:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-08 17:50:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-08 17:50:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-08 17:50:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-12-08 17:50:46,270 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 54 [2018-12-08 17:50:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:46,270 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-12-08 17:50:46,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:50:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-12-08 17:50:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:50:46,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:46,271 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:46,271 INFO L423 AbstractCegarLoop]: === Iteration 25 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:46,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1922483537, now seen corresponding path program 1 times [2018-12-08 17:50:46,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:46,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:46,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:46,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:46,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:46,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:46,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:46,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:47,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:47,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:47,024 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-08 17:50:47,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-08 17:50:47,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:47,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, 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-08 17:50:47,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-08 17:50:47,109 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 28 treesize of output 24 [2018-12-08 17:50:47,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:50:47,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,115 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-08 17:50:47,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-12-08 17:50:47,437 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 27 treesize of output 23 [2018-12-08 17:50:47,438 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 23 treesize of output 15 [2018-12-08 17:50:47,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:47,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:15 [2018-12-08 17:50:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:47,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:47,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28] total 58 [2018-12-08 17:50:47,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-08 17:50:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-08 17:50:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3104, Unknown=0, NotChecked=0, Total=3306 [2018-12-08 17:50:47,508 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 58 states. [2018-12-08 17:50:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:49,026 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-12-08 17:50:49,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 17:50:49,027 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 55 [2018-12-08 17:50:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:49,027 INFO L225 Difference]: With dead ends: 109 [2018-12-08 17:50:49,027 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 17:50:49,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=563, Invalid=7093, Unknown=0, NotChecked=0, Total=7656 [2018-12-08 17:50:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 17:50:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-08 17:50:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 17:50:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-12-08 17:50:49,031 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 55 [2018-12-08 17:50:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:49,031 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-12-08 17:50:49,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-08 17:50:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-12-08 17:50:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:50:49,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:49,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:49,032 INFO L423 AbstractCegarLoop]: === Iteration 26 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:49,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:49,032 INFO L82 PathProgramCache]: Analyzing trace with hash 175007029, now seen corresponding path program 1 times [2018-12-08 17:50:49,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:49,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:49,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:49,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:49,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:49,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:49,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:49,306 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-08 17:50:49,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:50:49,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:49,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:49,466 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-08 17:50:49,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-08 17:50:49,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:49,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 17:50:49,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-08 17:50:49,577 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 37 treesize of output 33 [2018-12-08 17:50:49,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:50:49,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,586 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-08 17:50:49,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-08 17:50:49,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:49,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:49,649 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 15 treesize of output 8 [2018-12-08 17:50:49,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,654 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-08 17:50:49,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2018-12-08 17:50:49,911 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:50:49,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:49,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:49,916 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-12-08 17:50:49,918 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:50:49,923 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-12-08 17:50:49,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:50:49,933 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-08 17:50:49,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,937 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 13 treesize of output 9 [2018-12-08 17:50:49,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:49,942 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-08 17:50:49,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:22 [2018-12-08 17:50:50,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-08 17:50:50,012 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-08 17:50:50,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:50,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:50,022 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-08 17:50:50,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-12-08 17:50:50,030 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-08 17:50:50,031 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-08 17:50:50,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:50,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:50,033 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-08 17:50:50,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-08 17:50:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:50:50,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:50,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 45 [2018-12-08 17:50:50,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-08 17:50:50,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-08 17:50:50,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1932, Unknown=0, NotChecked=0, Total=2070 [2018-12-08 17:50:50,056 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 46 states. [2018-12-08 17:50:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:52,292 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-12-08 17:50:52,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-08 17:50:52,293 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2018-12-08 17:50:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:52,294 INFO L225 Difference]: With dead ends: 116 [2018-12-08 17:50:52,294 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 17:50:52,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=339, Invalid=3821, Unknown=0, NotChecked=0, Total=4160 [2018-12-08 17:50:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 17:50:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2018-12-08 17:50:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-08 17:50:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-12-08 17:50:52,299 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 56 [2018-12-08 17:50:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:52,299 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-12-08 17:50:52,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-08 17:50:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-12-08 17:50:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:50:52,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:52,300 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:52,301 INFO L423 AbstractCegarLoop]: === Iteration 27 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:52,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash 175059644, now seen corresponding path program 2 times [2018-12-08 17:50:52,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:52,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:52,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:52,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:50:52,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:52,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:52,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 17:50:52,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:50:52,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:50:52,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:52,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:52,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:52,921 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-08 17:50:52,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:52,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:52,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-12-08 17:50:53,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:53,002 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-08 17:50:53,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:53,015 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-08 17:50:53,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-08 17:50:53,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:53,108 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 64 treesize of output 73 [2018-12-08 17:50:53,110 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 30 treesize of output 28 [2018-12-08 17:50:53,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,130 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 54 [2018-12-08 17:50:53,131 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-08 17:50:53,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:73 [2018-12-08 17:50:53,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:53,898 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 182 treesize of output 130 [2018-12-08 17:50:53,901 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:50:53,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 96 [2018-12-08 17:50:53,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-08 17:50:53,936 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 78 treesize of output 69 [2018-12-08 17:50:53,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,964 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 118 treesize of output 107 [2018-12-08 17:50:53,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:53,985 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 107 treesize of output 87 [2018-12-08 17:50:53,986 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-08 17:50:54,006 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 87 treesize of output 76 [2018-12-08 17:50:54,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:50:54,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 17:50:54,043 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:191, output treesize:164 [2018-12-08 17:50:54,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:54,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:54,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:54,176 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 67 [2018-12-08 17:50:54,194 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 77 [2018-12-08 17:50:54,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-12-08 17:50:54,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 17:50:54,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:54,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-08 17:50:54,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2018-12-08 17:50:54,288 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2018-12-08 17:50:54,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,294 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 40 [2018-12-08 17:50:54,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,300 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 1 case distinctions, treesize of input 57 treesize of output 56 [2018-12-08 17:50:54,300 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,302 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 34 [2018-12-08 17:50:54,302 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2018-12-08 17:50:54,391 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,396 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2018-12-08 17:50:54,396 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,397 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 34 treesize of output 23 [2018-12-08 17:50:54,397 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:54,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-12-08 17:50:54,400 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2018-12-08 17:50:54,405 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,406 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 32 treesize of output 23 [2018-12-08 17:50:54,406 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,411 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 1 case distinctions, treesize of input 38 treesize of output 35 [2018-12-08 17:50:54,411 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-08 17:50:54,476 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 34 treesize of output 23 [2018-12-08 17:50:54,477 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:54,522 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 23 treesize of output 19 [2018-12-08 17:50:54,522 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-08 17:50:54,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-08 17:50:54,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-08 17:50:54,609 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 3 variables, input treesize:79, output treesize:121 [2018-12-08 17:50:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:50:54,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 54 [2018-12-08 17:50:54,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-08 17:50:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-08 17:50:54,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2792, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 17:50:54,878 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 55 states. [2018-12-08 17:50:56,411 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-12-08 17:50:57,470 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-12-08 17:50:57,811 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-12-08 17:50:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:50:58,683 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-12-08 17:50:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 17:50:58,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2018-12-08 17:50:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:50:58,685 INFO L225 Difference]: With dead ends: 121 [2018-12-08 17:50:58,685 INFO L226 Difference]: Without dead ends: 121 [2018-12-08 17:50:58,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=379, Invalid=4733, Unknown=0, NotChecked=0, Total=5112 [2018-12-08 17:50:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-08 17:50:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2018-12-08 17:50:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 17:50:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2018-12-08 17:50:58,690 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 56 [2018-12-08 17:50:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:50:58,690 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-12-08 17:50:58,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-08 17:50:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2018-12-08 17:50:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:50:58,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:50:58,691 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:50:58,691 INFO L423 AbstractCegarLoop]: === Iteration 28 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:50:58,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:50:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash 175059645, now seen corresponding path program 2 times [2018-12-08 17:50:58,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:50:58,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:50:58,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:58,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:50:58,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:50:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:50:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:50:59,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:50:59,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:50:59,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 17:50:59,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:50:59,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:50:59,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:50:59,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:59,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:59,337 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-08 17:50:59,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-12-08 17:50:59,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:59,410 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-08 17:50:59,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:50:59,421 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-08 17:50:59,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-08 17:50:59,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:50:59,500 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 55 treesize of output 64 [2018-12-08 17:50:59,502 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 30 treesize of output 28 [2018-12-08 17:50:59,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,518 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 54 [2018-12-08 17:50:59,519 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-08 17:50:59,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:50:59,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:59 [2018-12-08 17:51:00,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:00,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:00,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:00,529 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 1 case distinctions, treesize of input 190 treesize of output 157 [2018-12-08 17:51:00,542 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 132 [2018-12-08 17:51:00,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:51:00,680 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 142 treesize of output 115 [2018-12-08 17:51:00,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:00,789 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 115 treesize of output 96 [2018-12-08 17:51:00,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:00,894 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 96 treesize of output 72 [2018-12-08 17:51:00,895 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-08 17:51:00,992 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:01,001 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 91 [2018-12-08 17:51:01,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:01,006 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:01,007 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 97 treesize of output 79 [2018-12-08 17:51:01,008 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 17:51:01,136 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 78 treesize of output 62 [2018-12-08 17:51:01,138 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 58 treesize of output 43 [2018-12-08 17:51:01,138 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,157 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 43 treesize of output 32 [2018-12-08 17:51:01,158 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,182 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 32 treesize of output 25 [2018-12-08 17:51:01,182 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2018-12-08 17:51:01,201 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,218 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 26 treesize of output 21 [2018-12-08 17:51:01,218 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,235 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 78 treesize of output 62 [2018-12-08 17:51:01,237 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 58 treesize of output 43 [2018-12-08 17:51:01,237 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,256 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 43 treesize of output 36 [2018-12-08 17:51:01,257 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,274 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 36 treesize of output 25 [2018-12-08 17:51:01,275 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,291 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 43 treesize of output 32 [2018-12-08 17:51:01,292 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,306 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 32 treesize of output 21 [2018-12-08 17:51:01,307 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,317 INFO L267 ElimStorePlain]: Start of recursive call 15: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,320 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 93 treesize of output 65 [2018-12-08 17:51:01,321 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 50 treesize of output 31 [2018-12-08 17:51:01,321 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,332 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 15 treesize of output 3 [2018-12-08 17:51:01,332 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,341 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-08 17:51:01,341 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,347 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:01,365 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-08 17:51:01,365 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 3 variables, input treesize:211, output treesize:13 [2018-12-08 17:51:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:51:01,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:51:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 53 [2018-12-08 17:51:01,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-08 17:51:01,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-08 17:51:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2018-12-08 17:51:01,424 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 53 states. [2018-12-08 17:51:02,274 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-08 17:51:04,362 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-12-08 17:51:04,822 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-12-08 17:51:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:05,602 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-08 17:51:05,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 17:51:05,602 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 56 [2018-12-08 17:51:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:05,602 INFO L225 Difference]: With dead ends: 102 [2018-12-08 17:51:05,602 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 17:51:05,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=324, Invalid=4368, Unknown=0, NotChecked=0, Total=4692 [2018-12-08 17:51:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 17:51:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-08 17:51:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 17:51:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-12-08 17:51:05,605 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 56 [2018-12-08 17:51:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:05,605 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-12-08 17:51:05,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-08 17:51:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-12-08 17:51:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:51:05,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:05,605 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:51:05,606 INFO L423 AbstractCegarLoop]: === Iteration 29 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:51:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1130250775, now seen corresponding path program 1 times [2018-12-08 17:51:05,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:51:05,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:51:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:05,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:51:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 17:51:05,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:05,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:51:05,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:05,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:05,996 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-08 17:51:05,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:05,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:05,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:51:06,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:06,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:06,052 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-08 17:51:06,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-12-08 17:51:06,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:51:06,109 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-08 17:51:06,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 17:51:06,168 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 37 treesize of output 33 [2018-12-08 17:51:06,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:51:06,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,177 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-08 17:51:06,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-08 17:51:06,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:06,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:06,239 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 15 treesize of output 8 [2018-12-08 17:51:06,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,245 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-08 17:51:06,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-12-08 17:51:06,394 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 67 treesize of output 59 [2018-12-08 17:51:06,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-12-08 17:51:06,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,406 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-08 17:51:06,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:67 [2018-12-08 17:51:06,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:06,577 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:06,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:06,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 72 [2018-12-08 17:51:06,597 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 26 treesize of output 39 [2018-12-08 17:51:06,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:06,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:51:06,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:51:06,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:87, output treesize:102 [2018-12-08 17:51:06,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2018-12-08 17:51:06,687 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 31 treesize of output 27 [2018-12-08 17:51:06,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,695 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 17 treesize of output 10 [2018-12-08 17:51:06,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2018-12-08 17:51:06,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:06,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:51:06,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:06,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:5 [2018-12-08 17:51:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 17:51:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:51:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 42 [2018-12-08 17:51:06,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-08 17:51:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-08 17:51:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 17:51:06,754 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 43 states. [2018-12-08 17:51:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:07,929 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-12-08 17:51:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 17:51:07,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 57 [2018-12-08 17:51:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:07,929 INFO L225 Difference]: With dead ends: 100 [2018-12-08 17:51:07,929 INFO L226 Difference]: Without dead ends: 100 [2018-12-08 17:51:07,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2018-12-08 17:51:07,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-08 17:51:07,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-08 17:51:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 17:51:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-12-08 17:51:07,932 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 57 [2018-12-08 17:51:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:07,932 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-12-08 17:51:07,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-08 17:51:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-12-08 17:51:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:51:07,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:07,933 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:51:07,933 INFO L423 AbstractCegarLoop]: === Iteration 30 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:51:07,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 678035832, now seen corresponding path program 1 times [2018-12-08 17:51:07,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:51:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:51:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:51:08,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:08,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:51:08,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:08,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:08,740 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-08 17:51:08,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:08,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:08,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:51:08,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 17:51:08,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 17:51:09,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-08 17:51:09,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:09,078 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 41 treesize of output 45 [2018-12-08 17:51:09,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:51:09,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,087 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-08 17:51:09,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-08 17:51:09,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:09,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:09,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:09,304 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 20 treesize of output 21 [2018-12-08 17:51:09,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,316 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-08 17:51:09,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-12-08 17:51:09,606 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 67 treesize of output 59 [2018-12-08 17:51:09,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-12-08 17:51:09,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:09,622 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-08 17:51:09,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:71 [2018-12-08 17:51:09,935 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:09,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:09,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:09,937 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:09,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2018-12-08 17:51:09,953 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 26 treesize of output 39 [2018-12-08 17:51:09,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:09,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:51:09,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 17:51:09,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:91, output treesize:110 [2018-12-08 17:51:10,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2018-12-08 17:51:10,071 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 15 treesize of output 11 [2018-12-08 17:51:10,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:10,074 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-08 17:51:10,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:10,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:10,077 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-08 17:51:10,077 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-12-08 17:51:10,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:10,079 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-08 17:51:10,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:10,083 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-08 17:51:10,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-08 17:51:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:51:10,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:51:10,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 56 [2018-12-08 17:51:10,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-08 17:51:10,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-08 17:51:10,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3017, Unknown=0, NotChecked=0, Total=3192 [2018-12-08 17:51:10,152 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 57 states. [2018-12-08 17:51:12,009 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-08 17:51:12,321 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-12-08 17:51:12,682 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2018-12-08 17:51:13,005 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-08 17:51:13,370 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-12-08 17:51:13,838 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-12-08 17:51:14,281 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-12-08 17:51:14,885 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-12-08 17:51:15,315 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-12-08 17:51:16,071 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-12-08 17:51:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:18,616 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-12-08 17:51:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 17:51:18,617 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2018-12-08 17:51:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:18,617 INFO L225 Difference]: With dead ends: 100 [2018-12-08 17:51:18,617 INFO L226 Difference]: Without dead ends: 100 [2018-12-08 17:51:18,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=493, Invalid=6647, Unknown=0, NotChecked=0, Total=7140 [2018-12-08 17:51:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-08 17:51:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-08 17:51:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-08 17:51:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-12-08 17:51:18,619 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 58 [2018-12-08 17:51:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:18,619 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-12-08 17:51:18,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-08 17:51:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-12-08 17:51:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 17:51:18,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:18,620 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:51:18,620 INFO L423 AbstractCegarLoop]: === Iteration 31 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:51:18,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:18,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1952227256, now seen corresponding path program 1 times [2018-12-08 17:51:18,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:51:18,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:51:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:18,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:51:20,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:20,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:51:20,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:20,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:20,360 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-08 17:51:20,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:51:20,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:20,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:20,563 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-08 17:51:20,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-12-08 17:51:20,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:51:20,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 8 treesize of output 7 [2018-12-08 17:51:20,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:51:20,797 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-08 17:51:20,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:20,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-08 17:51:21,030 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 27 treesize of output 28 [2018-12-08 17:51:21,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:51:21,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:21,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:21,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-08 17:51:21,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:51:21,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:21,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:21,094 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-08 17:51:21,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:50 [2018-12-08 17:51:21,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:21,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:21,209 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 15 treesize of output 8 [2018-12-08 17:51:21,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:21,216 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-08 17:51:21,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:52 [2018-12-08 17:51:23,594 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 36 [2018-12-08 17:51:24,516 WARN L180 SmtUtils]: Spent 841.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-08 17:51:24,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:24,527 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 92 treesize of output 111 [2018-12-08 17:51:24,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:24,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:24,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 123 [2018-12-08 17:51:24,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:24,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 17:51:24,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:197, output treesize:385 [2018-12-08 17:51:27,844 WARN L180 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-08 17:51:30,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,094 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:51:30,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 195 treesize of output 174 [2018-12-08 17:51:30,111 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 42 treesize of output 59 [2018-12-08 17:51:30,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:51:30,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,142 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 122 treesize of output 137 [2018-12-08 17:51:30,154 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 138 [2018-12-08 17:51:30,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:51:30,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:51:30,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,209 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 142 treesize of output 143 [2018-12-08 17:51:30,221 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 153 [2018-12-08 17:51:30,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:51:30,269 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:51:30,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2018-12-08 17:51:30,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 157 [2018-12-08 17:51:30,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 5 treesize of output 1 [2018-12-08 17:51:30,445 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,462 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 86 treesize of output 74 [2018-12-08 17:51:30,462 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,472 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,477 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 113 treesize of output 107 [2018-12-08 17:51:30,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 72 treesize of output 58 [2018-12-08 17:51:30,480 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,493 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-08 17:51:30,493 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,502 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,508 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 121 treesize of output 119 [2018-12-08 17:51:30,510 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 72 treesize of output 58 [2018-12-08 17:51:30,511 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,525 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-08 17:51:30,526 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,536 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,542 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 101 treesize of output 97 [2018-12-08 17:51:30,544 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-08 17:51:30,544 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,556 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 49 treesize of output 39 [2018-12-08 17:51:30,556 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,565 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,571 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 109 treesize of output 109 [2018-12-08 17:51:30,574 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-08 17:51:30,574 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,589 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 59 treesize of output 47 [2018-12-08 17:51:30,589 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,597 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:30,603 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 141 treesize of output 139 [2018-12-08 17:51:30,605 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-08 17:51:30,605 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,619 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 65 treesize of output 55 [2018-12-08 17:51:30,619 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,629 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:30,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 6 xjuncts. [2018-12-08 17:51:30,692 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 12 variables, input treesize:928, output treesize:466 [2018-12-08 17:51:30,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:51:31,002 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 51 treesize of output 48 [2018-12-08 17:51:31,003 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-08 17:51:31,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:31,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 7 treesize of output 1 [2018-12-08 17:51:31,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:31,016 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-08 17:51:31,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:31,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:31,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:51:31,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:11 [2018-12-08 17:51:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:51:31,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:51:31,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 66 [2018-12-08 17:51:31,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-08 17:51:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-08 17:51:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4209, Unknown=2, NotChecked=0, Total=4422 [2018-12-08 17:51:31,131 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 67 states. [2018-12-08 17:51:37,590 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-08 17:51:39,213 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-08 17:51:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:51:51,762 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-12-08 17:51:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-08 17:51:51,763 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-12-08 17:51:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:51:51,763 INFO L225 Difference]: With dead ends: 163 [2018-12-08 17:51:51,763 INFO L226 Difference]: Without dead ends: 163 [2018-12-08 17:51:51,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2889 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=908, Invalid=11296, Unknown=6, NotChecked=0, Total=12210 [2018-12-08 17:51:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-08 17:51:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2018-12-08 17:51:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-08 17:51:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-12-08 17:51:51,767 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 66 [2018-12-08 17:51:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:51:51,767 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-12-08 17:51:51,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-08 17:51:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-12-08 17:51:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 17:51:51,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:51:51,767 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:51:51,768 INFO L423 AbstractCegarLoop]: === Iteration 32 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:51:51,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:51:51,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1952227257, now seen corresponding path program 1 times [2018-12-08 17:51:51,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:51:51,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:51:51,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:51,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:51,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:51:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:51:52,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:51:52,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:51:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:51:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:51:52,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:51:52,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2018-12-08 17:51:52,766 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 51 treesize of output 45 [2018-12-08 17:51:52,766 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-08 17:51:52,778 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 45 treesize of output 30 [2018-12-08 17:51:52,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 38 [2018-12-08 17:51:52,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:51:52,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:51:52,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2018-12-08 17:51:52,830 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 28 treesize of output 17 [2018-12-08 17:51:52,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,840 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 17 treesize of output 15 [2018-12-08 17:51:52,840 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,850 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 24 treesize of output 14 [2018-12-08 17:51:52,850 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-12-08 17:51:52,858 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 15 treesize of output 11 [2018-12-08 17:51:52,858 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-08 17:51:52,863 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-08 17:51:52,864 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,866 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-08 17:51:52,872 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 22 treesize of output 18 [2018-12-08 17:51:52,872 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-08 17:51:52,882 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 18 treesize of output 11 [2018-12-08 17:51:52,882 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-12-08 17:51:52,893 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,898 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:52,908 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 2 variables, input treesize:67, output treesize:13 [2018-12-08 17:51:53,000 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-08 17:51:53,001 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-08 17:51:53,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,009 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-08 17:51:53,011 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-08 17:51:53,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23 [2018-12-08 17:51:53,154 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-08 17:51:53,155 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-08 17:51:53,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,160 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-08 17:51:53,162 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-08 17:51:53,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:51:53,166 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-08 17:51:53,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-12-08 17:51:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:51:53,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:51:53,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 16] total 48 [2018-12-08 17:51:53,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-08 17:51:53,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-08 17:51:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2204, Unknown=0, NotChecked=0, Total=2352 [2018-12-08 17:51:53,217 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 49 states. [2018-12-08 17:51:57,156 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2018-12-08 17:51:58,169 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2018-12-08 17:51:58,792 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-08 17:51:59,579 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-08 17:51:59,995 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-08 17:52:00,245 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-08 17:52:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:52:02,709 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-12-08 17:52:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-08 17:52:02,709 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 66 [2018-12-08 17:52:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:52:02,710 INFO L225 Difference]: With dead ends: 218 [2018-12-08 17:52:02,710 INFO L226 Difference]: Without dead ends: 218 [2018-12-08 17:52:02,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1052, Invalid=10504, Unknown=0, NotChecked=0, Total=11556 [2018-12-08 17:52:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-08 17:52:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2018-12-08 17:52:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-08 17:52:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2018-12-08 17:52:02,713 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 66 [2018-12-08 17:52:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:52:02,713 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2018-12-08 17:52:02,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-08 17:52:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2018-12-08 17:52:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 17:52:02,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:52:02,713 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:52:02,714 INFO L423 AbstractCegarLoop]: === Iteration 33 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:52:02,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:52:02,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1962381513, now seen corresponding path program 1 times [2018-12-08 17:52:02,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:52:02,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:52:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:02,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:02,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:52:03,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:52:03,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:52:03,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:03,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:52:03,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:03,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:03,179 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-08 17:52:03,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-08 17:52:03,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:52:03,230 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-08 17:52:03,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-08 17:52:03,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 17:52:03,288 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-08 17:52:03,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,296 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-08 17:52:03,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-12-08 17:52:03,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2018-12-08 17:52:03,766 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 20 treesize of output 19 [2018-12-08 17:52:03,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-08 17:52:03,776 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 43 treesize of output 37 [2018-12-08 17:52:03,779 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 37 treesize of output 31 [2018-12-08 17:52:03,780 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-08 17:52:03,789 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-08 17:52:03,822 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 52 treesize of output 56 [2018-12-08 17:52:03,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-12-08 17:52:03,829 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-08 17:52:03,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, 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 18 [2018-12-08 17:52:03,892 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,938 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 33 treesize of output 26 [2018-12-08 17:52:03,939 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,972 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:52:03,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-08 17:52:03,974 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:03,992 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:11 [2018-12-08 17:52:04,101 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-08 17:52:04,102 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-08 17:52:04,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:04,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:04,104 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-08 17:52:04,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-08 17:52:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:52:04,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:52:04,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 47 [2018-12-08 17:52:04,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-08 17:52:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-08 17:52:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2123, Unknown=0, NotChecked=0, Total=2256 [2018-12-08 17:52:04,159 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand 48 states. [2018-12-08 17:52:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:52:06,432 INFO L93 Difference]: Finished difference Result 187 states and 215 transitions. [2018-12-08 17:52:06,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-08 17:52:06,432 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 71 [2018-12-08 17:52:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:52:06,433 INFO L225 Difference]: With dead ends: 187 [2018-12-08 17:52:06,433 INFO L226 Difference]: Without dead ends: 187 [2018-12-08 17:52:06,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=528, Invalid=5952, Unknown=0, NotChecked=0, Total=6480 [2018-12-08 17:52:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-08 17:52:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2018-12-08 17:52:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-08 17:52:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2018-12-08 17:52:06,437 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 71 [2018-12-08 17:52:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:52:06,437 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2018-12-08 17:52:06,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-08 17:52:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2018-12-08 17:52:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:52:06,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:52:06,438 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:52:06,438 INFO L423 AbstractCegarLoop]: === Iteration 34 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:52:06,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:52:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash 357995244, now seen corresponding path program 1 times [2018-12-08 17:52:06,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:52:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:52:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:06,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:52:06,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:52:06,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/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-08 17:52:06,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:06,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:52:06,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-12-08 17:52:06,851 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 49 treesize of output 38 [2018-12-08 17:52:06,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:06,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-12-08 17:52:06,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:52:06,879 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 38 treesize of output 34 [2018-12-08 17:52:06,880 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-08 17:52:06,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:52:06,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:52:06,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:109 [2018-12-08 17:52:07,043 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 65 [2018-12-08 17:52:07,046 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-08 17:52:07,102 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 34 treesize of output 33 [2018-12-08 17:52:07,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:07,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 17:52:07,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:52:07,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:52:07,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 63 [2018-12-08 17:52:07,269 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-08 17:52:07,321 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 30 treesize of output 29 [2018-12-08 17:52:07,321 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:07,345 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-12-08 17:52:07,345 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:52:07,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:52:07,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 55 [2018-12-08 17:52:07,463 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 17:52:07,463 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:52:07,514 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 30 treesize of output 29 [2018-12-08 17:52:07,514 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:07,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-12-08 17:52:07,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 11 dim-0 vars, and 10 xjuncts. [2018-12-08 17:52:07,654 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:148, output treesize:335 [2018-12-08 17:52:07,818 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-08 17:52:07,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:07,823 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-08 17:52:07,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:34 [2018-12-08 17:52:07,859 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-08 17:52:07,861 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-08 17:52:07,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:07,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:07,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 69 [2018-12-08 17:52:07,897 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 48 treesize of output 47 [2018-12-08 17:52:07,898 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-08 17:52:07,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-12-08 17:52:07,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:08,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-08 17:52:08,063 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:08,133 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-08 17:52:08,255 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-08 17:52:08,422 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-08 17:52:08,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-12-08 17:52:08,606 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-08 17:52:08,762 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:09,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 9 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-12-08 17:52:09,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2018-12-08 17:52:09,282 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:63, output treesize:441 [2018-12-08 17:52:10,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:10,188 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 76 treesize of output 69 [2018-12-08 17:52:10,189 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 31 treesize of output 32 [2018-12-08 17:52:10,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,199 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 22 treesize of output 6 [2018-12-08 17:52:10,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,205 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-08 17:52:10,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-12-08 17:52:10,226 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-08 17:52:10,226 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,232 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:10,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2018-12-08 17:52:10,251 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-08 17:52:10,251 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,259 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-08 17:52:10,259 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,264 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,275 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-08 17:52:10,276 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-08 17:52:10,276 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,280 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:52:10,289 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:143, output treesize:39 [2018-12-08 17:52:10,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:10,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:10,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:10,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 17:52:10,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:10,373 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-08 17:52:10,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-12-08 17:52:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:52:10,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:52:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-12-08 17:52:10,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-08 17:52:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-08 17:52:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 17:52:10,443 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand 39 states. [2018-12-08 17:52:11,625 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 66 [2018-12-08 17:52:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:52:14,388 INFO L93 Difference]: Finished difference Result 272 states and 309 transitions. [2018-12-08 17:52:14,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-08 17:52:14,388 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2018-12-08 17:52:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:52:14,389 INFO L225 Difference]: With dead ends: 272 [2018-12-08 17:52:14,389 INFO L226 Difference]: Without dead ends: 272 [2018-12-08 17:52:14,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=836, Invalid=6136, Unknown=0, NotChecked=0, Total=6972 [2018-12-08 17:52:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-08 17:52:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 224. [2018-12-08 17:52:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-08 17:52:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2018-12-08 17:52:14,395 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 73 [2018-12-08 17:52:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:52:14,395 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2018-12-08 17:52:14,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-08 17:52:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2018-12-08 17:52:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 17:52:14,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:52:14,396 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:52:14,396 INFO L423 AbstractCegarLoop]: === Iteration 35 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:52:14,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:52:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1051390995, now seen corresponding path program 1 times [2018-12-08 17:52:14,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:52:14,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:52:14,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:14,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:14,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:52:15,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:52:15,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:52:15,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:15,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:52:15,236 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-08 17:52:15,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:52:15,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:15,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:15,303 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-08 17:52:15,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-12-08 17:52:15,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:52:15,362 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-08 17:52:15,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-08 17:52:15,427 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 37 treesize of output 33 [2018-12-08 17:52:15,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:52:15,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,439 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-08 17:52:15,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-12-08 17:52:15,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:15,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:15,515 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 15 treesize of output 8 [2018-12-08 17:52:15,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:15,519 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-08 17:52:15,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2018-12-08 17:52:16,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, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 222 [2018-12-08 17:52:16,035 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 2 case distinctions, treesize of input 54 treesize of output 83 [2018-12-08 17:52:16,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:52:16,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:16,072 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 3 case distinctions, treesize of input 261 treesize of output 201 [2018-12-08 17:52:16,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:16,166 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 228 treesize of output 189 [2018-12-08 17:52:16,167 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-08 17:52:16,243 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 175 treesize of output 181 [2018-12-08 17:52:16,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:16,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:52:16,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:16,339 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 3 case distinctions, treesize of input 253 treesize of output 205 [2018-12-08 17:52:16,341 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 222 treesize of output 185 [2018-12-08 17:52:16,342 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-08 17:52:16,422 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 175 treesize of output 177 [2018-12-08 17:52:16,423 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:16,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:52:16,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-08 17:52:17,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,312 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 178 [2018-12-08 17:52:17,314 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 40 treesize of output 39 [2018-12-08 17:52:17,314 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:17,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,331 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 159 treesize of output 145 [2018-12-08 17:52:17,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 111 [2018-12-08 17:52:17,334 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-08 17:52:17,343 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-08 17:52:17,352 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,359 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 185 treesize of output 133 [2018-12-08 17:52:17,361 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 28 treesize of output 27 [2018-12-08 17:52:17,361 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:17,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,377 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 128 treesize of output 125 [2018-12-08 17:52:17,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 84 [2018-12-08 17:52:17,380 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-08 17:52:17,390 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-08 17:52:17,398 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,402 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 181 treesize of output 129 [2018-12-08 17:52:17,404 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 28 treesize of output 27 [2018-12-08 17:52:17,404 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:17,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,416 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 128 treesize of output 105 [2018-12-08 17:52:17,419 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-12-08 17:52:17,420 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-08 17:52:17,430 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,438 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,447 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 182 [2018-12-08 17:52:17,449 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 40 treesize of output 39 [2018-12-08 17:52:17,449 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:17,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,466 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 163 treesize of output 149 [2018-12-08 17:52:17,469 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 115 [2018-12-08 17:52:17,469 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,478 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,487 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,492 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 177 treesize of output 125 [2018-12-08 17:52:17,493 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 28 treesize of output 27 [2018-12-08 17:52:17,494 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:17,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 99 [2018-12-08 17:52:17,509 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-08 17:52:17,510 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,521 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,528 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,535 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 189 treesize of output 137 [2018-12-08 17:52:17,537 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 28 treesize of output 27 [2018-12-08 17:52:17,537 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:17,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:17,554 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 132 treesize of output 129 [2018-12-08 17:52:17,557 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 88 [2018-12-08 17:52:17,557 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-08 17:52:17,568 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-08 17:52:17,576 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:52:17,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2018-12-08 17:52:17,650 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 3 variables, input treesize:333, output treesize:578 [2018-12-08 17:52:18,495 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2018-12-08 17:52:18,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 17:52:18,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,508 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 54 treesize of output 38 [2018-12-08 17:52:18,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,540 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 109 [2018-12-08 17:52:18,541 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 31 treesize of output 32 [2018-12-08 17:52:18,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,554 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 31 treesize of output 23 [2018-12-08 17:52:18,555 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,564 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 38 [2018-12-08 17:52:18,565 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,593 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 60 treesize of output 44 [2018-12-08 17:52:18,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 17:52:18,594 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,603 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-08 17:52:18,603 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,609 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-08 17:52:18,609 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2018-12-08 17:52:18,628 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 29 treesize of output 15 [2018-12-08 17:52:18,628 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,633 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-08 17:52:18,634 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,637 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:18,646 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:243, output treesize:7 [2018-12-08 17:52:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:52:18,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:52:18,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 59 [2018-12-08 17:52:18,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-08 17:52:18,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-08 17:52:18,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3246, Unknown=0, NotChecked=0, Total=3422 [2018-12-08 17:52:18,706 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand 59 states. [2018-12-08 17:52:22,033 WARN L180 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-12-08 17:52:23,474 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-12-08 17:52:32,996 WARN L180 SmtUtils]: Spent 9.43 s on a formula simplification. DAG size of input: 129 DAG size of output: 71 [2018-12-08 17:52:42,513 WARN L180 SmtUtils]: Spent 9.42 s on a formula simplification. DAG size of input: 136 DAG size of output: 79 [2018-12-08 17:52:46,307 WARN L180 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2018-12-08 17:52:47,024 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 92 [2018-12-08 17:52:50,504 WARN L180 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 141 DAG size of output: 72 [2018-12-08 17:52:50,784 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2018-12-08 17:52:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:52:52,235 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-12-08 17:52:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-08 17:52:52,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 77 [2018-12-08 17:52:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:52:52,236 INFO L225 Difference]: With dead ends: 208 [2018-12-08 17:52:52,236 INFO L226 Difference]: Without dead ends: 198 [2018-12-08 17:52:52,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=797, Invalid=8905, Unknown=0, NotChecked=0, Total=9702 [2018-12-08 17:52:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-08 17:52:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-12-08 17:52:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-08 17:52:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2018-12-08 17:52:52,240 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 77 [2018-12-08 17:52:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:52:52,240 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2018-12-08 17:52:52,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-08 17:52:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2018-12-08 17:52:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 17:52:52,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:52:52,241 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:52:52,241 INFO L423 AbstractCegarLoop]: === Iteration 36 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:52:52,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:52:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1849361539, now seen corresponding path program 1 times [2018-12-08 17:52:52,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:52:52,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:52:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:52,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:52:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:54,624 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-12-08 17:52:54,920 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-12-08 17:52:55,512 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 24 [2018-12-08 17:52:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:52:56,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:52:56,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:52:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:52:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:52:56,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:52:57,380 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-08 17:52:57,381 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-08 17:52:57,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:57,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:57,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:57,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-12-08 17:52:57,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:52:57,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2018-12-08 17:52:57,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 17:52:57,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:52:57,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:52:57,555 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-08 17:52:57,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-12-08 17:53:02,173 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-08 17:53:02,744 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 17:53:03,246 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 17:53:04,250 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_remove_first_~last~1.offset Int)) (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_remove_first_#in~head.base|) |c_sll_circular_remove_first_#in~head.offset|)) (select (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_remove_first_#in~head.base|) |c_sll_circular_remove_first_#in~head.offset|)))) (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| .cse2 (store (select |c_old(#memory_$Pointer$.base)| .cse2) sll_circular_remove_first_~last~1.offset .cse2)))) (let ((.cse0 (select .cse1 |c_sll_circular_remove_first_#in~head.base|))) (and (= |c_#valid| (store |c_old(#valid)| (select .cse0 |c_sll_circular_remove_first_#in~head.offset|) 0)) (= |c_#memory_$Pointer$.base| (store .cse1 |c_sll_circular_remove_first_#in~head.base| (store .cse0 |c_sll_circular_remove_first_#in~head.offset| .cse2)))))))) is different from true [2018-12-08 17:53:04,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,302 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 210 treesize of output 162 [2018-12-08 17:53:04,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 59 [2018-12-08 17:53:04,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 17:53:04,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,338 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 133 treesize of output 142 [2018-12-08 17:53:04,340 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 147 treesize of output 122 [2018-12-08 17:53:04,341 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-08 17:53:04,352 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-08 17:53:04,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,361 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 153 treesize of output 148 [2018-12-08 17:53:04,363 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 166 treesize of output 137 [2018-12-08 17:53:04,364 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-08 17:53:04,374 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-08 17:53:04,396 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-08 17:53:04,422 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 109 treesize of output 95 [2018-12-08 17:53:04,424 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 95 treesize of output 81 [2018-12-08 17:53:04,424 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-08 17:53:04,432 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-08 17:53:04,434 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 97 treesize of output 85 [2018-12-08 17:53:04,435 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 82 treesize of output 70 [2018-12-08 17:53:04,436 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-08 17:53:04,444 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-08 17:53:04,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-08 17:53:04,470 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:269, output treesize:168 [2018-12-08 17:53:04,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:53:04,902 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 77 treesize of output 78 [2018-12-08 17:53:04,904 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 27 treesize of output 19 [2018-12-08 17:53:04,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:53:04,913 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-08 17:53:04,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:53:04,918 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 43 treesize of output 35 [2018-12-08 17:53:04,919 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-08 17:53:04,923 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-08 17:53:04,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:53:04,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:40 [2018-12-08 17:53:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2018-12-08 17:53:12,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:53:12,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 72 [2018-12-08 17:53:12,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-08 17:53:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-08 17:53:12,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4849, Unknown=18, NotChecked=140, Total=5256 [2018-12-08 17:53:12,169 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 73 states. [2018-12-08 17:53:13,996 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2018-12-08 17:53:14,313 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2018-12-08 17:53:14,733 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 63 [2018-12-08 17:53:27,098 WARN L180 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-12-08 17:53:28,098 WARN L180 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-12-08 17:53:29,087 WARN L180 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-12-08 17:53:31,019 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2018-12-08 17:53:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:53:44,553 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-12-08 17:53:44,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-08 17:53:44,554 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 80 [2018-12-08 17:53:44,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:53:44,554 INFO L225 Difference]: With dead ends: 200 [2018-12-08 17:53:44,554 INFO L226 Difference]: Without dead ends: 197 [2018-12-08 17:53:44,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=583, Invalid=10308, Unknown=33, NotChecked=206, Total=11130 [2018-12-08 17:53:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-08 17:53:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2018-12-08 17:53:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-08 17:53:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-12-08 17:53:44,557 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 80 [2018-12-08 17:53:44,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:53:44,557 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-12-08 17:53:44,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-08 17:53:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-12-08 17:53:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 17:53:44,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:53:44,557 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:53:44,558 INFO L423 AbstractCegarLoop]: === Iteration 37 === [sll_circular_remove_firstErr10REQUIRES_VIOLATION, sll_circular_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr12REQUIRES_VIOLATION, sll_circular_remove_firstErr11REQUIRES_VIOLATION, sll_circular_remove_firstErr15REQUIRES_VIOLATION, sll_circular_remove_firstErr13REQUIRES_VIOLATION, sll_circular_remove_firstErr14REQUIRES_VIOLATION, sll_circular_remove_firstErr17REQUIRES_VIOLATION, sll_circular_remove_firstErr18REQUIRES_VIOLATION, sll_circular_remove_firstErr16REQUIRES_VIOLATION, sll_circular_remove_firstErr24ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr20REQUIRES_VIOLATION, sll_circular_remove_firstErr19REQUIRES_VIOLATION, sll_circular_remove_firstErr1REQUIRES_VIOLATION, sll_circular_remove_firstErr2REQUIRES_VIOLATION, sll_circular_remove_firstErr23REQUIRES_VIOLATION, sll_circular_remove_firstErr0REQUIRES_VIOLATION, sll_circular_remove_firstErr21REQUIRES_VIOLATION, sll_circular_remove_firstErr22REQUIRES_VIOLATION, sll_circular_remove_firstErr25ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr4REQUIRES_VIOLATION, sll_circular_remove_firstErr26REQUIRES_VIOLATION, sll_circular_remove_firstErr3REQUIRES_VIOLATION, sll_circular_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, sll_circular_remove_firstErr7REQUIRES_VIOLATION, sll_circular_remove_firstErr5REQUIRES_VIOLATION, sll_circular_remove_firstErr6REQUIRES_VIOLATION, sll_circular_remove_firstErr27REQUIRES_VIOLATION, sll_circular_createErr1REQUIRES_VIOLATION, sll_circular_createErr2REQUIRES_VIOLATION, sll_circular_createErr0REQUIRES_VIOLATION, sll_circular_createErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr3REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2018-12-08 17:53:44,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:53:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1490387668, now seen corresponding path program 1 times [2018-12-08 17:53:44,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 17:53:44,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 17:53:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:53:44,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:53:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:53:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:53:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:53:44,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:53:44,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:53:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:53:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:53:44,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:53:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:53:44,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:53:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-12-08 17:53:44,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:53:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:53:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:53:44,671 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 9 states. [2018-12-08 17:53:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:53:44,686 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-08 17:53:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:53:44,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-12-08 17:53:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:53:44,687 INFO L225 Difference]: With dead ends: 70 [2018-12-08 17:53:44,687 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 17:53:44,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:53:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 17:53:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 17:53:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 17:53:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 17:53:44,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-12-08 17:53:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:53:44,688 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:53:44,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:53:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:53:44,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 17:53:44,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:53:44 BoogieIcfgContainer [2018-12-08 17:53:44,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:53:44,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:53:44,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:53:44,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:53:44,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:48:15" (3/4) ... [2018-12-08 17:53:44,693 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_remove_first [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 17:53:44,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-08 17:53:44,702 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-08 17:53:44,702 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 17:53:44,703 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 17:53:44,733 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_582b9d3e-e4e6-4d81-b955-a1ea8021efbb/bin-2019/uautomizer/witness.graphml [2018-12-08 17:53:44,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:53:44,734 INFO L168 Benchmark]: Toolchain (without parser) took 329826.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 42.5 MB). Free memory was 951.7 MB in the beginning and 768.6 MB in the end (delta: 183.1 MB). Peak memory consumption was 225.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:53:44,734 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:53:44,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:53:44,735 INFO L168 Benchmark]: Boogie Preprocessor took 30.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:53:44,735 INFO L168 Benchmark]: RCFGBuilder took 348.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.5 MB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:53:44,735 INFO L168 Benchmark]: TraceAbstraction took 329116.78 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.9 MB). Free memory was 988.5 MB in the beginning and 775.3 MB in the end (delta: 213.2 MB). Peak memory consumption was 182.2 MB. Max. memory is 11.5 GB. [2018-12-08 17:53:44,735 INFO L168 Benchmark]: Witness Printer took 42.29 ms. Allocated memory is still 1.1 GB. Free memory was 775.3 MB in the beginning and 768.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:53:44,736 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 348.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.5 MB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 329116.78 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.9 MB). Free memory was 988.5 MB in the beginning and 775.3 MB in the end (delta: 213.2 MB). Peak memory consumption was 182.2 MB. Max. memory is 11.5 GB. * Witness Printer took 42.29 ms. Allocated memory is still 1.1 GB. Free memory was 775.3 MB in the beginning and 768.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 591]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: 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: 595]: 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: 594]: 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: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: 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: 587]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 596]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: 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: 577]: 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: 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: 599]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: 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 - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 111 locations, 39 error locations. SAFE Result, 329.0s OverallTime, 37 OverallIterations, 3 TraceHistogramMax, 261.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2052 SDtfs, 5893 SDslu, 16778 SDs, 0 SdLazy, 35860 SolverSat, 1238 SolverUnsat, 132 SolverUnknown, 0 SolverNotchecked, 165.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2365 GetRequests, 928 SyntacticMatches, 59 SemanticMatches, 1378 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20931 ImplicationChecksByTransitivity, 147.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 519 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 66.0s InterpolantComputationTime, 3013 NumberOfCodeBlocks, 3013 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2954 ConstructedInterpolants, 284 QuantifiedInterpolants, 3591766 SizeOfPredicates, 424 NumberOfNonLiveVariables, 7074 ConjunctsInSsa, 1521 ConjunctsInUnsatCore, 59 InterpolantComputations, 16 PerfectInterpolantSequences, 377/745 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...