./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.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_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 b50a14aaadb91f0d2171e26e1cac3b7310be0682 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 23:45:52,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:45:52,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:45:52,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:45:52,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:45:52,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:45:52,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:45:52,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:45:52,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:45:52,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:45:52,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:45:52,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:45:52,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:45:52,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:45:52,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:45:52,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:45:52,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:45:52,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:45:52,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:45:52,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:45:52,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:45:52,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:45:52,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:45:52,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:45:52,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:45:52,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:45:52,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:45:52,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:45:52,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:45:52,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:45:52,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:45:52,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:45:52,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:45:52,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:45:52,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:45:52,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:45:52,338 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 23:45:52,345 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:45:52,345 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:45:52,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:45:52,346 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 23:45:52,346 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 23:45:52,346 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 23:45:52,346 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 23:45:52,346 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:45:52,347 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 23:45:52,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:45:52,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 23:45:52,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:45:52,348 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_2edcf877-4b69-4676-af93-072aec2bff88/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 -> b50a14aaadb91f0d2171e26e1cac3b7310be0682 [2018-12-08 23:45:52,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:45:52,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:45:52,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:45:52,380 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:45:52,380 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:45:52,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-12-08 23:45:52,426 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/data/d0e552599/30359c796b6b40749001c5a37f6e46a6/FLAG66f91cf88 [2018-12-08 23:45:52,842 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:45:52,842 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/sv-benchmarks/c/heap-manipulation/tree_false-unreach-call_false-valid-deref.i [2018-12-08 23:45:52,848 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/data/d0e552599/30359c796b6b40749001c5a37f6e46a6/FLAG66f91cf88 [2018-12-08 23:45:52,856 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/data/d0e552599/30359c796b6b40749001c5a37f6e46a6 [2018-12-08 23:45:52,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:45:52,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 23:45:52,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:45:52,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:45:52,861 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:45:52,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:45:52" (1/1) ... [2018-12-08 23:45:52,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b06587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:52, skipping insertion in model container [2018-12-08 23:45:52,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:45:52" (1/1) ... [2018-12-08 23:45:52,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:45:52,892 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:45:53,047 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:45:53,085 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:45:53,118 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:45:53,146 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:45:53,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53 WrapperNode [2018-12-08 23:45:53,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:45:53,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:45:53,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:45:53,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:45:53,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... [2018-12-08 23:45:53,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:45:53,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:45:53,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:45:53,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:45:53,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:45:53,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2018-12-08 23:45:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 23:45:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 23:45:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 23:45:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 23:45:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 23:45:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 23:45:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 23:45:53,226 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 23:45:53,227 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 23:45:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 23:45:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 23:45:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 23:45:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:45:53,560 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:45:53,560 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-08 23:45:53,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:45:53 BoogieIcfgContainer [2018-12-08 23:45:53,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:45:53,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 23:45:53,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 23:45:53,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 23:45:53,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:45:52" (1/3) ... [2018-12-08 23:45:53,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b5a6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:45:53, skipping insertion in model container [2018-12-08 23:45:53,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:45:53" (2/3) ... [2018-12-08 23:45:53,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b5a6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:45:53, skipping insertion in model container [2018-12-08 23:45:53,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:45:53" (3/3) ... [2018-12-08 23:45:53,565 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_false-unreach-call_false-valid-deref.i [2018-12-08 23:45:53,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 23:45:53,576 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-12-08 23:45:53,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2018-12-08 23:45:53,600 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 23:45:53,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 23:45:53,600 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 23:45:53,601 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 23:45:53,601 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 23:45:53,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 23:45:53,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 23:45:53,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 23:45:53,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 23:45:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2018-12-08 23:45:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 23:45:53,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:53,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:53,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:53,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash -153905189, now seen corresponding path program 1 times [2018-12-08 23:45:53,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:53,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:53,705 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 23:45:53,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:53,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 23:45:53,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 23:45:53,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 23:45:53,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 23:45:53,718 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 2 states. [2018-12-08 23:45:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:53,737 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-12-08 23:45:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 23:45:53,738 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-08 23:45:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:53,744 INFO L225 Difference]: With dead ends: 150 [2018-12-08 23:45:53,745 INFO L226 Difference]: Without dead ends: 143 [2018-12-08 23:45:53,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 23:45:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-08 23:45:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-08 23:45:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-08 23:45:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-12-08 23:45:53,773 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 10 [2018-12-08 23:45:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:53,773 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-12-08 23:45:53,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 23:45:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-12-08 23:45:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:45:53,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:53,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:53,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:53,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash -477114141, now seen corresponding path program 1 times [2018-12-08 23:45:53,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:53,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:53,811 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 23:45:53,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:53,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:45:53,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:45:53,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:45:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:53,812 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 3 states. [2018-12-08 23:45:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:53,862 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-12-08 23:45:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:45:53,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-08 23:45:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:53,863 INFO L225 Difference]: With dead ends: 146 [2018-12-08 23:45:53,863 INFO L226 Difference]: Without dead ends: 146 [2018-12-08 23:45:53,864 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 23:45:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-08 23:45:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-08 23:45:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-08 23:45:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-12-08 23:45:53,871 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 11 [2018-12-08 23:45:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:53,871 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-12-08 23:45:53,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:45:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-12-08 23:45:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:45:53,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:53,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:53,871 INFO L423 AbstractCegarLoop]: === Iteration 3 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:53,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash -477113242, now seen corresponding path program 1 times [2018-12-08 23:45:53,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:53,907 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 23:45:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:53,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 23:45:53,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:45:53,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:45:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:53,908 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 3 states. [2018-12-08 23:45:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:53,993 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2018-12-08 23:45:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:45:53,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-08 23:45:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:53,996 INFO L225 Difference]: With dead ends: 144 [2018-12-08 23:45:53,996 INFO L226 Difference]: Without dead ends: 144 [2018-12-08 23:45:53,997 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 23:45:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-08 23:45:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-12-08 23:45:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-08 23:45:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2018-12-08 23:45:54,004 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 11 [2018-12-08 23:45:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,005 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2018-12-08 23:45:54,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:45:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2018-12-08 23:45:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:45:54,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:54,006 INFO L423 AbstractCegarLoop]: === Iteration 4 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -477113241, now seen corresponding path program 1 times [2018-12-08 23:45:54,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,046 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 23:45:54,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:54,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 23:45:54,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:45:54,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:45:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:54,047 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand 3 states. [2018-12-08 23:45:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:54,132 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-12-08 23:45:54,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:45:54,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-08 23:45:54,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:54,134 INFO L225 Difference]: With dead ends: 163 [2018-12-08 23:45:54,134 INFO L226 Difference]: Without dead ends: 163 [2018-12-08 23:45:54,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-08 23:45:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-12-08 23:45:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-08 23:45:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2018-12-08 23:45:54,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 11 [2018-12-08 23:45:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,140 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2018-12-08 23:45:54,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:45:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2018-12-08 23:45:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 23:45:54,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:54,141 INFO L423 AbstractCegarLoop]: === Iteration 5 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1633802846, now seen corresponding path program 1 times [2018-12-08 23:45:54,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,163 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 23:45:54,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:54,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:45:54,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:45:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:45:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:54,164 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand 3 states. [2018-12-08 23:45:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:54,176 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2018-12-08 23:45:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:45:54,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-08 23:45:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:54,178 INFO L225 Difference]: With dead ends: 161 [2018-12-08 23:45:54,178 INFO L226 Difference]: Without dead ends: 161 [2018-12-08 23:45:54,178 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 23:45:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-08 23:45:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-12-08 23:45:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-08 23:45:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-12-08 23:45:54,184 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 14 [2018-12-08 23:45:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,185 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-12-08 23:45:54,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:45:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-12-08 23:45:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 23:45:54,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:54,185 INFO L423 AbstractCegarLoop]: === Iteration 6 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1464839699, now seen corresponding path program 1 times [2018-12-08 23:45:54,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,200 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 23:45:54,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 23:45:54,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:45:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:45:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:54,201 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 3 states. [2018-12-08 23:45:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:54,278 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-12-08 23:45:54,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:45:54,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-08 23:45:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:54,280 INFO L225 Difference]: With dead ends: 195 [2018-12-08 23:45:54,280 INFO L226 Difference]: Without dead ends: 194 [2018-12-08 23:45:54,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 23:45:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-08 23:45:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 160. [2018-12-08 23:45:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-08 23:45:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-12-08 23:45:54,287 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 16 [2018-12-08 23:45:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,287 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-12-08 23:45:54,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:45:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-12-08 23:45:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 23:45:54,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:54,288 INFO L423 AbstractCegarLoop]: === Iteration 7 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash -316129894, now seen corresponding path program 1 times [2018-12-08 23:45:54,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,328 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 23:45:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:54,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:45:54,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:45:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:45:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:45:54,329 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 6 states. [2018-12-08 23:45:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:54,354 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-12-08 23:45:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:45:54,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-08 23:45:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:54,355 INFO L225 Difference]: With dead ends: 165 [2018-12-08 23:45:54,355 INFO L226 Difference]: Without dead ends: 159 [2018-12-08 23:45:54,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 23:45:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-08 23:45:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2018-12-08 23:45:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-08 23:45:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2018-12-08 23:45:54,358 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 21 [2018-12-08 23:45:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,359 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2018-12-08 23:45:54,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:45:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2018-12-08 23:45:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:45:54,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,359 INFO L402 BasicCegarLoop]: trace histogram [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 23:45:54,360 INFO L423 AbstractCegarLoop]: === Iteration 8 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,360 INFO L82 PathProgramCache]: Analyzing trace with hash 99516259, now seen corresponding path program 1 times [2018-12-08 23:45:54,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 23:45:54,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:54,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:45:54,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:45:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:45:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:45:54,402 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 5 states. [2018-12-08 23:45:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:54,540 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2018-12-08 23:45:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:45:54,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-08 23:45:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:54,541 INFO L225 Difference]: With dead ends: 156 [2018-12-08 23:45:54,541 INFO L226 Difference]: Without dead ends: 156 [2018-12-08 23:45:54,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:45:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-08 23:45:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-12-08 23:45:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-08 23:45:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-12-08 23:45:54,545 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 23 [2018-12-08 23:45:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,545 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-12-08 23:45:54,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:45:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-12-08 23:45:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:45:54,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,545 INFO L402 BasicCegarLoop]: trace histogram [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 23:45:54,546 INFO L423 AbstractCegarLoop]: === Iteration 9 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 99516260, now seen corresponding path program 1 times [2018-12-08 23:45:54,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 23:45:54,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:54,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:45:54,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:45:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:45:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:45:54,621 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 5 states. [2018-12-08 23:45:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:54,730 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2018-12-08 23:45:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:45:54,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-08 23:45:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:54,731 INFO L225 Difference]: With dead ends: 155 [2018-12-08 23:45:54,731 INFO L226 Difference]: Without dead ends: 155 [2018-12-08 23:45:54,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:45:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-08 23:45:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-12-08 23:45:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-08 23:45:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-12-08 23:45:54,734 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 23 [2018-12-08 23:45:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:54,734 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-12-08 23:45:54,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:45:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-12-08 23:45:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:45:54,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:54,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:54,735 INFO L423 AbstractCegarLoop]: === Iteration 10 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:54,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash 126263707, now seen corresponding path program 1 times [2018-12-08 23:45:54,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:54,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:54,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:45:54,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:45:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:54,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:45:54,840 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 23:45:54,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:54,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:54,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 23:45:54,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:54,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:54,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 23:45:54,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:54,857 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 23:45:54,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-08 23:45:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:45:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 23:45:54,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:45:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:45:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:45:54,886 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 6 states. [2018-12-08 23:45:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:55,040 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2018-12-08 23:45:55,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 23:45:55,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-08 23:45:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:55,041 INFO L225 Difference]: With dead ends: 163 [2018-12-08 23:45:55,041 INFO L226 Difference]: Without dead ends: 163 [2018-12-08 23:45:55,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:45:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-08 23:45:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-12-08 23:45:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-08 23:45:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2018-12-08 23:45:55,044 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 23 [2018-12-08 23:45:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:55,044 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2018-12-08 23:45:55,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:45:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2018-12-08 23:45:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 23:45:55,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:55,045 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:55,045 INFO L423 AbstractCegarLoop]: === Iteration 11 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:55,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 126263708, now seen corresponding path program 1 times [2018-12-08 23:45:55,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:55,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:45:55,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:45:55,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:55,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:45:55,128 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 23:45:55,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:55,139 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 23:45:55,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:55,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:55,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 23:45:55,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:55,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:55,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 23:45:55,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:55,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 23:45:55,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:55,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:45:55,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-08 23:45:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:55,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:45:55,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-12-08 23:45:55,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 23:45:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 23:45:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:45:55,228 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand 8 states. [2018-12-08 23:45:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:55,512 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-12-08 23:45:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:45:55,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-08 23:45:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:55,513 INFO L225 Difference]: With dead ends: 169 [2018-12-08 23:45:55,513 INFO L226 Difference]: Without dead ends: 169 [2018-12-08 23:45:55,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-08 23:45:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-08 23:45:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2018-12-08 23:45:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-12-08 23:45:55,516 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 23 [2018-12-08 23:45:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:55,516 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-12-08 23:45:55,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 23:45:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-12-08 23:45:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 23:45:55,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:55,517 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:55,517 INFO L423 AbstractCegarLoop]: === Iteration 12 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:55,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash 671682508, now seen corresponding path program 1 times [2018-12-08 23:45:55,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:55,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:55,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:55,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:55,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:55,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:45:55,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:45:55,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:45:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:55,532 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 3 states. [2018-12-08 23:45:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:55,558 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-12-08 23:45:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:45:55,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 23:45:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:55,558 INFO L225 Difference]: With dead ends: 157 [2018-12-08 23:45:55,559 INFO L226 Difference]: Without dead ends: 157 [2018-12-08 23:45:55,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:45:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-08 23:45:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-12-08 23:45:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-12-08 23:45:55,561 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 25 [2018-12-08 23:45:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:55,561 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-12-08 23:45:55,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:45:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-12-08 23:45:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:45:55,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:55,561 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:55,562 INFO L423 AbstractCegarLoop]: === Iteration 13 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:55,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1161487314, now seen corresponding path program 1 times [2018-12-08 23:45:55,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:55,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:55,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:55,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:55,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:45:55,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 23:45:55,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 23:45:55,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:45:55,635 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 8 states. [2018-12-08 23:45:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:55,879 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-12-08 23:45:55,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 23:45:55,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-08 23:45:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:55,880 INFO L225 Difference]: With dead ends: 156 [2018-12-08 23:45:55,880 INFO L226 Difference]: Without dead ends: 156 [2018-12-08 23:45:55,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-08 23:45:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-08 23:45:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2018-12-08 23:45:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2018-12-08 23:45:55,882 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 26 [2018-12-08 23:45:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:55,883 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2018-12-08 23:45:55,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 23:45:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2018-12-08 23:45:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 23:45:55,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:55,883 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:45:55,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:55,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1161487315, now seen corresponding path program 1 times [2018-12-08 23:45:55,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:55,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:55,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:55,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:45:55,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 23:45:55,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 23:45:55,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:45:55,960 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 8 states. [2018-12-08 23:45:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:56,205 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2018-12-08 23:45:56,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:45:56,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-08 23:45:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:56,206 INFO L225 Difference]: With dead ends: 155 [2018-12-08 23:45:56,206 INFO L226 Difference]: Without dead ends: 155 [2018-12-08 23:45:56,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-12-08 23:45:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-08 23:45:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2018-12-08 23:45:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2018-12-08 23:45:56,208 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 26 [2018-12-08 23:45:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:56,209 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2018-12-08 23:45:56,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 23:45:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2018-12-08 23:45:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 23:45:56,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:56,209 INFO L402 BasicCegarLoop]: trace histogram [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 23:45:56,209 INFO L423 AbstractCegarLoop]: === Iteration 15 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:56,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1612091434, now seen corresponding path program 1 times [2018-12-08 23:45:56,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:56,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:56,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:56,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 23:45:56,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 23:45:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 23:45:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 23:45:56,290 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 9 states. [2018-12-08 23:45:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:56,470 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-12-08 23:45:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 23:45:56,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-08 23:45:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:56,471 INFO L225 Difference]: With dead ends: 154 [2018-12-08 23:45:56,471 INFO L226 Difference]: Without dead ends: 154 [2018-12-08 23:45:56,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-08 23:45:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-08 23:45:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-08 23:45:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-12-08 23:45:56,474 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 29 [2018-12-08 23:45:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:56,474 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-12-08 23:45:56,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 23:45:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-12-08 23:45:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-08 23:45:56,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:56,475 INFO L402 BasicCegarLoop]: trace histogram [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 23:45:56,475 INFO L423 AbstractCegarLoop]: === Iteration 16 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:56,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1612091435, now seen corresponding path program 1 times [2018-12-08 23:45:56,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:56,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:56,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:56,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:56,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 23:45:56,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 23:45:56,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 23:45:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 23:45:56,598 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 9 states. [2018-12-08 23:45:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:56,849 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-12-08 23:45:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 23:45:56,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-08 23:45:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:56,850 INFO L225 Difference]: With dead ends: 153 [2018-12-08 23:45:56,850 INFO L226 Difference]: Without dead ends: 153 [2018-12-08 23:45:56,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-08 23:45:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-08 23:45:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-12-08 23:45:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-12-08 23:45:56,854 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 29 [2018-12-08 23:45:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:56,854 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-12-08 23:45:56,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 23:45:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2018-12-08 23:45:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 23:45:56,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:56,854 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 23:45:56,855 INFO L423 AbstractCegarLoop]: === Iteration 17 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:56,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash -508329991, now seen corresponding path program 1 times [2018-12-08 23:45:56,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:56,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:56,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:56,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 23:45:56,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 23:45:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 23:45:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 23:45:56,952 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 10 states. [2018-12-08 23:45:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:57,150 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-12-08 23:45:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 23:45:57,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-08 23:45:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:57,151 INFO L225 Difference]: With dead ends: 152 [2018-12-08 23:45:57,151 INFO L226 Difference]: Without dead ends: 152 [2018-12-08 23:45:57,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-12-08 23:45:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-08 23:45:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-12-08 23:45:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-12-08 23:45:57,153 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 32 [2018-12-08 23:45:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:57,153 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-12-08 23:45:57,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 23:45:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-12-08 23:45:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 23:45:57,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:57,154 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 23:45:57,154 INFO L423 AbstractCegarLoop]: === Iteration 18 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:57,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:57,154 INFO L82 PathProgramCache]: Analyzing trace with hash -508329990, now seen corresponding path program 1 times [2018-12-08 23:45:57,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:57,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:57,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:57,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:57,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:45:57,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 23:45:57,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 23:45:57,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 23:45:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 23:45:57,262 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 10 states. [2018-12-08 23:45:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:45:57,851 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-12-08 23:45:57,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 23:45:57,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-12-08 23:45:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:45:57,852 INFO L225 Difference]: With dead ends: 151 [2018-12-08 23:45:57,853 INFO L226 Difference]: Without dead ends: 151 [2018-12-08 23:45:57,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-12-08 23:45:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-08 23:45:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-12-08 23:45:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 23:45:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-12-08 23:45:57,855 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 32 [2018-12-08 23:45:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:45:57,856 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-12-08 23:45:57,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 23:45:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-12-08 23:45:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 23:45:57,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:45:57,856 INFO L402 BasicCegarLoop]: trace histogram [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 23:45:57,856 INFO L423 AbstractCegarLoop]: === Iteration 19 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:45:57,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:45:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1701515022, now seen corresponding path program 1 times [2018-12-08 23:45:57,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:45:57,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:45:57,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:57,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:57,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:45:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:45:58,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:45:58,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:45:58,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:45:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:45:58,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:45:58,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:45:58,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 23:45:58,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:45:58,104 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 23:45:58,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-12-08 23:45:58,117 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 29 treesize of output 24 [2018-12-08 23:45:58,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:58,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-08 23:45:58,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,134 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 29 treesize of output 24 [2018-12-08 23:45:58,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:58,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-08 23:45:58,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:24 [2018-12-08 23:45:58,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:58,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:58,150 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 23:45:58,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-12-08 23:45:58,164 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 24 treesize of output 19 [2018-12-08 23:45:58,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:58,170 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 16 treesize of output 23 [2018-12-08 23:45:58,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,182 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 24 treesize of output 19 [2018-12-08 23:45:58,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:45:58,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 23:45:58,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,197 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 23:45:58,197 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:27 [2018-12-08 23:45:58,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-08 23:45:58,233 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 23:45:58,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,249 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 29 treesize of output 30 [2018-12-08 23:45:58,251 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 23:45:58,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,262 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 23:45:58,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:49 [2018-12-08 23:45:58,318 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 82 treesize of output 72 [2018-12-08 23:45:58,321 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 20 treesize of output 25 [2018-12-08 23:45:58,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,345 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 42 treesize of output 37 [2018-12-08 23:45:58,348 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 20 treesize of output 25 [2018-12-08 23:45:58,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:45:58,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:45:58,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:75 [2018-12-08 23:46:04,407 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-12-08 23:46:04,440 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 54 treesize of output 49 [2018-12-08 23:46:04,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:46:04,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:46:04,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:46:04,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-12-08 23:46:04,475 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:46:04,476 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 32 treesize of output 31 [2018-12-08 23:46:04,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2018-12-08 23:46:04,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:46:04,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 23:46:04,502 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:46:04,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 23:46:04,518 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:115, output treesize:81 [2018-12-08 23:46:04,550 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 31 treesize of output 32 [2018-12-08 23:46:04,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:46:04,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-12-08 23:46:04,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:46:04,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,577 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 23:46:04,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-12-08 23:46:04,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-12-08 23:46:04,611 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 23:46:04,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:04,618 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 32 treesize of output 23 [2018-12-08 23:46:04,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:04,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:04,631 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 28 treesize of output 26 [2018-12-08 23:46:04,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 15 treesize of output 3 [2018-12-08 23:46:04,633 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,637 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 23:46:04,637 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,638 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:04,641 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:7 [2018-12-08 23:46:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:04,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:46:04,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-12-08 23:46:04,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 23:46:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 23:46:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=384, Unknown=2, NotChecked=0, Total=462 [2018-12-08 23:46:04,670 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 22 states. [2018-12-08 23:46:19,424 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-08 23:46:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:46:25,833 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-12-08 23:46:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 23:46:25,834 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-12-08 23:46:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:46:25,834 INFO L225 Difference]: With dead ends: 176 [2018-12-08 23:46:25,834 INFO L226 Difference]: Without dead ends: 176 [2018-12-08 23:46:25,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=236, Invalid=1161, Unknown=9, NotChecked=0, Total=1406 [2018-12-08 23:46:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-08 23:46:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2018-12-08 23:46:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-08 23:46:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-12-08 23:46:25,837 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 37 [2018-12-08 23:46:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:46:25,837 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-12-08 23:46:25,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 23:46:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-12-08 23:46:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 23:46:25,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:46:25,837 INFO L402 BasicCegarLoop]: trace histogram [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 23:46:25,838 INFO L423 AbstractCegarLoop]: === Iteration 20 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:46:25,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:46:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash -266911900, now seen corresponding path program 1 times [2018-12-08 23:46:25,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:46:25,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:46:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:25,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 23:46:25,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:46:25,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 23:46:25,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 23:46:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 23:46:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 23:46:25,866 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 7 states. [2018-12-08 23:46:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:46:25,935 INFO L93 Difference]: Finished difference Result 174 states and 182 transitions. [2018-12-08 23:46:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 23:46:25,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-12-08 23:46:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:46:25,936 INFO L225 Difference]: With dead ends: 174 [2018-12-08 23:46:25,936 INFO L226 Difference]: Without dead ends: 174 [2018-12-08 23:46:25,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 23:46:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-08 23:46:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-12-08 23:46:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-08 23:46:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 181 transitions. [2018-12-08 23:46:25,939 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 181 transitions. Word has length 42 [2018-12-08 23:46:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:46:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 181 transitions. [2018-12-08 23:46:25,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 23:46:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2018-12-08 23:46:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 23:46:25,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:46:25,940 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:46:25,940 INFO L423 AbstractCegarLoop]: === Iteration 21 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:46:25,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:46:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1314138391, now seen corresponding path program 1 times [2018-12-08 23:46:25,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:46:25,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:46:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:25,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:25,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:46:25,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:46:26,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:26,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:46:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:26,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:46:26,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-12-08 23:46:26,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 23:46:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 23:46:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 23:46:26,074 INFO L87 Difference]: Start difference. First operand 173 states and 181 transitions. Second operand 10 states. [2018-12-08 23:46:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:46:26,299 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2018-12-08 23:46:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 23:46:26,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-12-08 23:46:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:46:26,300 INFO L225 Difference]: With dead ends: 176 [2018-12-08 23:46:26,300 INFO L226 Difference]: Without dead ends: 176 [2018-12-08 23:46:26,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-08 23:46:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-08 23:46:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-12-08 23:46:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-08 23:46:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-12-08 23:46:26,302 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 47 [2018-12-08 23:46:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:46:26,303 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-12-08 23:46:26,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 23:46:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-12-08 23:46:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 23:46:26,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:46:26,303 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:46:26,304 INFO L423 AbstractCegarLoop]: === Iteration 22 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:46:26,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:46:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1314138390, now seen corresponding path program 1 times [2018-12-08 23:46:26,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:46:26,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:46:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:26,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:46:26,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:46:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:26,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:46:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:26,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:46:26,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-12-08 23:46:26,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 23:46:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 23:46:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-08 23:46:26,474 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 11 states. [2018-12-08 23:46:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:46:26,733 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-12-08 23:46:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 23:46:26,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-12-08 23:46:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:46:26,734 INFO L225 Difference]: With dead ends: 189 [2018-12-08 23:46:26,734 INFO L226 Difference]: Without dead ends: 189 [2018-12-08 23:46:26,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-08 23:46:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-08 23:46:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2018-12-08 23:46:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-08 23:46:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-12-08 23:46:26,737 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 47 [2018-12-08 23:46:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:46:26,737 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-12-08 23:46:26,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 23:46:26,737 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-12-08 23:46:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 23:46:26,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:46:26,737 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:46:26,737 INFO L423 AbstractCegarLoop]: === Iteration 23 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:46:26,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:46:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash 245714365, now seen corresponding path program 1 times [2018-12-08 23:46:26,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:46:26,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:46:26,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:26,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:26,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:26,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:46:26,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:46:26,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:26,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:46:26,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 23:46:26,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 23:46:26,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:26,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:26,972 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 23:46:26,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-08 23:46:26,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:46:26,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 23:46:26,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:26,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-08 23:46:27,015 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 23 treesize of output 24 [2018-12-08 23:46:27,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 23:46:27,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:27,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:42 [2018-12-08 23:46:27,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-08 23:46:27,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:27,061 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 47 treesize of output 45 [2018-12-08 23:46:27,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,080 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 23:46:27,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2018-12-08 23:46:27,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:27,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:27,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:27,087 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 28 treesize of output 52 [2018-12-08 23:46:27,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,098 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 23:46:27,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:61 [2018-12-08 23:46:27,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-08 23:46:27,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:27,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-12-08 23:46:27,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:27,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:73 [2018-12-08 23:46:27,210 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 87 treesize of output 86 [2018-12-08 23:46:27,212 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 23:46:27,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,229 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 23:46:27,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:84 [2018-12-08 23:46:27,300 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 100 treesize of output 93 [2018-12-08 23:46:27,303 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 20 treesize of output 25 [2018-12-08 23:46:27,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:27,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:27,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:97 [2018-12-08 23:46:33,372 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-12-08 23:46:33,420 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 112 treesize of output 105 [2018-12-08 23:46:33,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:46:33,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:46:33,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:46:33,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 23:46:33,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:160 [2018-12-08 23:46:33,543 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 89 treesize of output 88 [2018-12-08 23:46:33,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:46:33,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:33,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:33,561 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 23:46:33,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:86 [2018-12-08 23:46:33,602 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 90 treesize of output 67 [2018-12-08 23:46:33,605 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 48 treesize of output 29 [2018-12-08 23:46:33,606 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 23:46:33,615 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 23:46:33,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:33,621 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 23:46:33,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:33,625 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 23:46:33,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:33,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:28 [2018-12-08 23:46:33,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-08 23:46:33,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:33,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:33,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:33 [2018-12-08 23:46:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:33,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:46:33,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 27 [2018-12-08 23:46:33,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-08 23:46:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-08 23:46:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=611, Unknown=2, NotChecked=0, Total=756 [2018-12-08 23:46:33,726 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 28 states. [2018-12-08 23:46:48,760 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-08 23:46:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:46:55,278 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-12-08 23:46:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 23:46:55,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-12-08 23:46:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:46:55,279 INFO L225 Difference]: With dead ends: 218 [2018-12-08 23:46:55,279 INFO L226 Difference]: Without dead ends: 218 [2018-12-08 23:46:55,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=548, Invalid=2199, Unknown=9, NotChecked=0, Total=2756 [2018-12-08 23:46:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-08 23:46:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 177. [2018-12-08 23:46:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 23:46:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-12-08 23:46:55,282 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 47 [2018-12-08 23:46:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:46:55,282 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-12-08 23:46:55,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-08 23:46:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-12-08 23:46:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 23:46:55,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:46:55,282 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:46:55,282 INFO L423 AbstractCegarLoop]: === Iteration 24 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:46:55,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:46:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash 245714366, now seen corresponding path program 1 times [2018-12-08 23:46:55,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:46:55,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:46:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:55,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:46:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:46:55,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:46:55,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:46:55,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:46:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:46:55,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:46:55,668 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 23:46:55,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,673 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 23:46:55,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 23:46:55,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 23:46:55,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,708 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 23:46:55,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-08 23:46:55,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:46:55,752 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 23:46:55,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,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 13 treesize of output 10 [2018-12-08 23:46:55,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 23:46:55,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-08 23:46:55,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-08 23:46:55,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:46:55,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,819 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 69 treesize of output 63 [2018-12-08 23:46:55,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:46:55,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:78 [2018-12-08 23:46:55,866 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 42 treesize of output 47 [2018-12-08 23:46:55,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-08 23:46:55,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-12-08 23:46:55,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,894 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 65 treesize of output 67 [2018-12-08 23:46:55,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:78 [2018-12-08 23:46:55,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-08 23:46:55,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-08 23:46:55,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:81 [2018-12-08 23:46:55,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2018-12-08 23:46:55,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:55,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-12-08 23:46:55,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:55,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-12-08 23:46:56,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:46:56,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 23:46:56,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,024 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 23:46:56,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:93 [2018-12-08 23:46:56,094 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 117 treesize of output 116 [2018-12-08 23:46:56,096 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 23:46:56,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,126 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 42 treesize of output 67 [2018-12-08 23:46:56,128 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 23:46:56,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,147 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 23:46:56,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:115 [2018-12-08 23:46:56,238 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 143 treesize of output 136 [2018-12-08 23:46:56,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-12-08 23:46:56,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,279 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 55 treesize of output 74 [2018-12-08 23:46:56,281 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 20 treesize of output 25 [2018-12-08 23:46:56,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:46:56,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:46:56,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:141 [2018-12-08 23:47:02,370 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-08 23:47:02,432 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 167 treesize of output 160 [2018-12-08 23:47:02,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:47:02,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:47:02,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:47:02,507 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 139 treesize of output 126 [2018-12-08 23:47:02,509 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:47:02,510 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 32 treesize of output 31 [2018-12-08 23:47:02,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,529 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 145 treesize of output 132 [2018-12-08 23:47:02,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:47:02,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 23:47:02,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:47:02,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 23:47:02,587 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:181, output treesize:213 [2018-12-08 23:47:02,672 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 121 treesize of output 120 [2018-12-08 23:47:02,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:47:02,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,706 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 44 treesize of output 69 [2018-12-08 23:47:02,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:47:02,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,729 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 23:47:02,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:135, output treesize:119 [2018-12-08 23:47:02,786 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 114 treesize of output 87 [2018-12-08 23:47:02,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, 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 23:47:02,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,801 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 23:47:02,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,812 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 70 treesize of output 45 [2018-12-08 23:47:02,812 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 23:47:02,820 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 23:47:02,833 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 35 treesize of output 39 [2018-12-08 23:47:02,835 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 23:47:02,835 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,841 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 23:47:02,841 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,845 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 23:47:02,846 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:47:02,853 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:137, output treesize:31 [2018-12-08 23:47:02,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-12-08 23:47:02,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:02,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:47:02,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2018-12-08 23:47:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:47:02,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:47:02,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-12-08 23:47:02,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 23:47:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 23:47:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=930, Unknown=2, NotChecked=0, Total=1056 [2018-12-08 23:47:02,979 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 33 states. [2018-12-08 23:47:05,871 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-12-08 23:47:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:47:06,945 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-12-08 23:47:06,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 23:47:06,946 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-08 23:47:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:47:06,948 INFO L225 Difference]: With dead ends: 212 [2018-12-08 23:47:06,949 INFO L226 Difference]: Without dead ends: 212 [2018-12-08 23:47:06,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=567, Invalid=2623, Unknown=2, NotChecked=0, Total=3192 [2018-12-08 23:47:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-08 23:47:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2018-12-08 23:47:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-08 23:47:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 208 transitions. [2018-12-08 23:47:06,960 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 208 transitions. Word has length 47 [2018-12-08 23:47:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:47:06,960 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 208 transitions. [2018-12-08 23:47:06,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 23:47:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 208 transitions. [2018-12-08 23:47:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 23:47:06,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:47:06,963 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:47:06,963 INFO L423 AbstractCegarLoop]: === Iteration 25 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:47:06,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:47:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash -166604338, now seen corresponding path program 1 times [2018-12-08 23:47:06,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:47:06,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:47:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:47:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:47:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:47:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:47:07,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:47:07,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:47:07,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:47:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:07,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:47: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 6 treesize of output 5 [2018-12-08 23:47:07,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:07,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:07,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 23:47:08,150 WARN L180 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-08 23:47:08,483 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-12-08 23:47:08,496 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 40 [2018-12-08 23:47:08,498 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 32 treesize of output 31 [2018-12-08 23:47:08,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:08,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:08,521 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 23:47:08,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2018-12-08 23:47:08,858 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 23:47:09,208 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 23:47:09,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:09,212 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 21 treesize of output 33 [2018-12-08 23:47:09,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:09,226 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 18 treesize of output 12 [2018-12-08 23:47:09,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:09,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:09,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:09,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-12-08 23:47:09,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:09,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:09,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:47:09,239 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-12-08 23:47:09,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-08 23:47:09,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 23:47:09,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:47:09,363 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 12 [2018-12-08 23:47:09,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:09,370 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 12 treesize of output 4 [2018-12-08 23:47:09,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:09,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:09,377 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 23:47:09,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:4 [2018-12-08 23:47:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:47:09,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:47:09,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-12-08 23:47:09,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 23:47:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 23:47:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-12-08 23:47:09,415 INFO L87 Difference]: Start difference. First operand 191 states and 208 transitions. Second operand 26 states. [2018-12-08 23:47:11,809 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2018-12-08 23:47:15,090 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-08 23:47:16,152 WARN L180 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2018-12-08 23:47:17,229 WARN L180 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-12-08 23:47:18,781 WARN L180 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-08 23:47:22,459 WARN L180 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-08 23:47:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:47:26,853 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-12-08 23:47:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 23:47:26,853 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-12-08 23:47:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:47:26,854 INFO L225 Difference]: With dead ends: 283 [2018-12-08 23:47:26,854 INFO L226 Difference]: Without dead ends: 283 [2018-12-08 23:47:26,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=252, Invalid=2000, Unknown=4, NotChecked=0, Total=2256 [2018-12-08 23:47:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-08 23:47:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2018-12-08 23:47:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-08 23:47:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2018-12-08 23:47:26,859 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 49 [2018-12-08 23:47:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:47:26,859 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2018-12-08 23:47:26,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 23:47:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2018-12-08 23:47:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 23:47:26,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:47:26,860 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:47:26,860 INFO L423 AbstractCegarLoop]: === Iteration 26 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:47:26,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:47:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash -869791894, now seen corresponding path program 1 times [2018-12-08 23:47:26,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:47:26,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:47:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:47:26,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:47:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:47:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:47:26,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:47:26,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:47:27,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:47:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:27,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:47:27,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:27,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:27,030 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 23:47:27,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-08 23:47:27,048 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 23:47:27,049 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 23:47:27,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,056 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 23:47:27,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-12-08 23:47:27,084 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 23:47:27,085 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 23:47:27,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,092 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 23:47:27,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-08 23:47:27,133 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 31 [2018-12-08 23:47:27,136 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 20 treesize of output 25 [2018-12-08 23:47:27,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:27,144 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 23:47:27,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-12-08 23:47:33,178 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-12-08 23:47:33,210 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 53 treesize of output 43 [2018-12-08 23:47:33,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:47:33,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:47:33,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:47:33,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 23:47:33,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:44 [2018-12-08 23:47:33,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 23:47:33,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:47:33,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:33,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:33,270 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 23:47:33,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-12-08 23:47:33,394 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 38 treesize of output 26 [2018-12-08 23:47:33,396 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 23:47:33,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:33,400 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 23:47:33,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:33,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:33,404 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 23:47:33,404 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-12-08 23:47:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:47:33,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:47:33,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 27 [2018-12-08 23:47:33,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-08 23:47:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-08 23:47:33,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=675, Unknown=2, NotChecked=0, Total=756 [2018-12-08 23:47:33,424 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand 28 states. [2018-12-08 23:47:48,074 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-08 23:47:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:47:54,591 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2018-12-08 23:47:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 23:47:54,591 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2018-12-08 23:47:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:47:54,592 INFO L225 Difference]: With dead ends: 279 [2018-12-08 23:47:54,592 INFO L226 Difference]: Without dead ends: 279 [2018-12-08 23:47:54,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=278, Invalid=1691, Unknown=11, NotChecked=0, Total=1980 [2018-12-08 23:47:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-08 23:47:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 266. [2018-12-08 23:47:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 23:47:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 307 transitions. [2018-12-08 23:47:54,596 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 307 transitions. Word has length 50 [2018-12-08 23:47:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:47:54,596 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 307 transitions. [2018-12-08 23:47:54,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-08 23:47:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 307 transitions. [2018-12-08 23:47:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 23:47:54,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:47:54,597 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:47:54,597 INFO L423 AbstractCegarLoop]: === Iteration 27 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:47:54,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:47:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash -869791893, now seen corresponding path program 1 times [2018-12-08 23:47:54,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:47:54,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:47:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:47:54,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:47:54,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:47:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:47:55,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:47:55,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:47:55,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:47:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:47:55,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:47:55,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 23:47:55,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:55,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:47:55,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 23:47:55,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-08 23:47:55,111 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 23:47:55,113 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 23:47:55,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,127 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 23:47:55,129 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 23:47:55,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,137 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 23:47:55,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-12-08 23:47:55,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-08 23:47:55,181 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 23:47:55,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,197 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 23:47:55,198 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 23:47:55,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,209 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 23:47:55,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-12-08 23:47:55,272 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 82 treesize of output 72 [2018-12-08 23:47:55,275 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 20 treesize of output 25 [2018-12-08 23:47:55,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,298 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 40 treesize of output 35 [2018-12-08 23:47:55,301 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 20 treesize of output 25 [2018-12-08 23:47:55,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:47:55,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:47:55,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:79 [2018-12-08 23:48:01,363 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-12-08 23:48:01,411 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 106 treesize of output 96 [2018-12-08 23:48:01,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:48:01,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:01,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:01,453 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 82 treesize of output 69 [2018-12-08 23:48:01,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:48:01,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:01,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:01,475 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 76 treesize of output 63 [2018-12-08 23:48:01,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:48:01,478 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 32 treesize of output 31 [2018-12-08 23:48:01,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 23:48:01,507 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:119, output treesize:89 [2018-12-08 23:48:01,557 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 60 treesize of output 56 [2018-12-08 23:48:01,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:48:01,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-08 23:48:01,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:48:01,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,582 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 23:48:01,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-08 23:48:01,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-12-08 23:48:01,764 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 30 treesize of output 19 [2018-12-08 23:48:01,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,772 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 23:48:01,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,787 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 24 treesize of output 22 [2018-12-08 23:48:01,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, 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 23:48:01,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,792 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 23:48:01,793 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:01,796 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-08 23:48:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:48:01,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:48:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2018-12-08 23:48:01,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-08 23:48:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-08 23:48:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1191, Unknown=2, NotChecked=0, Total=1332 [2018-12-08 23:48:01,838 INFO L87 Difference]: Start difference. First operand 266 states and 307 transitions. Second operand 37 states. [2018-12-08 23:48:04,244 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-12-08 23:48:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:48:05,578 INFO L93 Difference]: Finished difference Result 281 states and 313 transitions. [2018-12-08 23:48:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 23:48:05,578 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2018-12-08 23:48:05,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:48:05,579 INFO L225 Difference]: With dead ends: 281 [2018-12-08 23:48:05,579 INFO L226 Difference]: Without dead ends: 281 [2018-12-08 23:48:05,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=358, Invalid=2190, Unknown=2, NotChecked=0, Total=2550 [2018-12-08 23:48:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-08 23:48:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2018-12-08 23:48:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 23:48:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 305 transitions. [2018-12-08 23:48:05,584 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 305 transitions. Word has length 50 [2018-12-08 23:48:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:48:05,584 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 305 transitions. [2018-12-08 23:48:05,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-08 23:48:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 305 transitions. [2018-12-08 23:48:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 23:48:05,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:48:05,585 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 23:48:05,585 INFO L423 AbstractCegarLoop]: === Iteration 28 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:48:05,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:48:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1457455045, now seen corresponding path program 1 times [2018-12-08 23:48:05,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:48:05,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:48:05,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:48:05,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:48:05,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:48:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:48:05,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:48:05,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:48:05,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:48:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:05,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:48:05,882 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 23:48:05,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 23:48:05,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:05,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:05,891 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 23:48:05,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 23:48:05,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:48:05,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 23:48:05,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-08 23:48:05,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-12-08 23:48:05,967 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 23:48:05,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:05,976 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 23:48:05,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-12-08 23:48:06,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-08 23:48:06,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:06,007 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 47 treesize of output 45 [2018-12-08 23:48:06,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,018 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 23:48:06,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:48 [2018-12-08 23:48:06,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:06,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:06,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:06,023 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 28 treesize of output 52 [2018-12-08 23:48:06,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,043 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 23:48:06,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:67 [2018-12-08 23:48:06,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-08 23:48:06,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:06,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-12-08 23:48:06,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:06,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:79 [2018-12-08 23:48:06,180 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 87 treesize of output 86 [2018-12-08 23:48:06,182 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 23:48:06,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,200 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 23:48:06,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-12-08 23:48:06,291 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 100 treesize of output 93 [2018-12-08 23:48:06,294 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 20 treesize of output 25 [2018-12-08 23:48:06,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:06,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:06,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:103 [2018-12-08 23:48:12,374 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-08 23:48:12,426 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 112 treesize of output 105 [2018-12-08 23:48:12,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:48:12,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:12,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:12,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 23:48:12,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:172 [2018-12-08 23:48:12,546 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 89 treesize of output 88 [2018-12-08 23:48:12,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:48:12,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:12,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:12,566 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 23:48:12,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-12-08 23:48:12,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:12,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:12,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:12,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:12,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-12-08 23:48:12,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:12,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:12,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:112, output treesize:128 [2018-12-08 23:48:12,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 123 [2018-12-08 23:48:12,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 23:48:12,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:12,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:12,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 23:48:12,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:139, output treesize:331 [2018-12-08 23:48:12,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:13,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 142 [2018-12-08 23:48:13,008 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 23:48:13,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:13,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:13,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:13,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:142, output treesize:128 [2018-12-08 23:48:13,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 101 [2018-12-08 23:48:13,104 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 23:48:13,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:13,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-12-08 23:48:13,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:13,127 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 23:48:13,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:13,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2018-12-08 23:48:13,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:13,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:13,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:13,165 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:174, output treesize:45 [2018-12-08 23:48:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:48:13,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:48:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2018-12-08 23:48:13,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-08 23:48:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-08 23:48:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1430, Unknown=2, NotChecked=0, Total=1640 [2018-12-08 23:48:13,231 INFO L87 Difference]: Start difference. First operand 266 states and 305 transitions. Second operand 41 states. [2018-12-08 23:48:28,764 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-08 23:48:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:48:35,899 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2018-12-08 23:48:35,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-08 23:48:35,899 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 53 [2018-12-08 23:48:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:48:35,900 INFO L225 Difference]: With dead ends: 272 [2018-12-08 23:48:35,900 INFO L226 Difference]: Without dead ends: 272 [2018-12-08 23:48:35,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=751, Invalid=4790, Unknown=9, NotChecked=0, Total=5550 [2018-12-08 23:48:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-08 23:48:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2018-12-08 23:48:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 23:48:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 304 transitions. [2018-12-08 23:48:35,905 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 304 transitions. Word has length 53 [2018-12-08 23:48:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:48:35,905 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 304 transitions. [2018-12-08 23:48:35,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-08 23:48:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 304 transitions. [2018-12-08 23:48:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 23:48:35,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:48:35,905 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 23:48:35,906 INFO L423 AbstractCegarLoop]: === Iteration 29 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:48:35,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:48:35,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1457455046, now seen corresponding path program 1 times [2018-12-08 23:48:35,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:48:35,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:48:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:48:35,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:48:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:48:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:48:36,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:48:36,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:48:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:48:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:36,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:48:36,189 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 23:48:36,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 23:48:36,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,195 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 23:48:36,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 23:48:36,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:48:36,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 23:48:36,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-08 23:48:36,268 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 47 treesize of output 41 [2018-12-08 23:48:36,270 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 23:48:36,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,279 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 23:48:36,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-12-08 23:48:36,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-08 23:48:36,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,313 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 47 treesize of output 45 [2018-12-08 23:48:36,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,324 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 23:48:36,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:48 [2018-12-08 23:48:36,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,328 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 28 treesize of output 52 [2018-12-08 23:48:36,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,339 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 23:48:36,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:67 [2018-12-08 23:48:36,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-08 23:48:36,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:36,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-12-08 23:48:36,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:36,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:79 [2018-12-08 23:48:36,469 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 87 treesize of output 86 [2018-12-08 23:48:36,471 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 23:48:36,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,490 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 23:48:36,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-12-08 23:48:36,589 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 100 treesize of output 93 [2018-12-08 23:48:36,592 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 20 treesize of output 25 [2018-12-08 23:48:36,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:36,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:36,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:103 [2018-12-08 23:48:42,684 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-12-08 23:48:42,740 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 112 treesize of output 105 [2018-12-08 23:48:42,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:48:42,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:42,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:42,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 23:48:42,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:172 [2018-12-08 23:48:42,868 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 89 treesize of output 88 [2018-12-08 23:48:42,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:48:42,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:42,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:42,890 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 23:48:42,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-12-08 23:48:43,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:43,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:43,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:43,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:43,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-12-08 23:48:43,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 23:48:43,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:43,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:115, output treesize:106 [2018-12-08 23:48:43,117 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 14 [2018-12-08 23:48:43,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 23:48:43,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 116 [2018-12-08 23:48:43,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 23:48:43,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:43,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:43,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 23:48:43,205 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:125, output treesize:295 [2018-12-08 23:48:43,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2018-12-08 23:48:43,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-08 23:48:43,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:43,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 166 [2018-12-08 23:48:43,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-08 23:48:43,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:43,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:157, output treesize:147 [2018-12-08 23:48:43,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 132 [2018-12-08 23:48:43,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2018-12-08 23:48:43,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,483 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 11 [2018-12-08 23:48:43,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,496 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 23:48:43,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 52 [2018-12-08 23:48:43,508 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 23:48:43,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:43,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-08 23:48:43,526 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 9 [2018-12-08 23:48:43,526 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,531 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 3 [2018-12-08 23:48:43,532 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,534 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:43,549 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:212, output treesize:9 [2018-12-08 23:48:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:48:43,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:48:43,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2018-12-08 23:48:43,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-08 23:48:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-08 23:48:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1377, Unknown=2, NotChecked=0, Total=1560 [2018-12-08 23:48:43,586 INFO L87 Difference]: Start difference. First operand 266 states and 304 transitions. Second operand 40 states. [2018-12-08 23:48:46,571 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-12-08 23:48:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:48:47,856 INFO L93 Difference]: Finished difference Result 271 states and 304 transitions. [2018-12-08 23:48:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-08 23:48:47,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 53 [2018-12-08 23:48:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:48:47,857 INFO L225 Difference]: With dead ends: 271 [2018-12-08 23:48:47,857 INFO L226 Difference]: Without dead ends: 271 [2018-12-08 23:48:47,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=649, Invalid=4179, Unknown=2, NotChecked=0, Total=4830 [2018-12-08 23:48:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-08 23:48:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 266. [2018-12-08 23:48:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 23:48:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 303 transitions. [2018-12-08 23:48:47,861 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 303 transitions. Word has length 53 [2018-12-08 23:48:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:48:47,861 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 303 transitions. [2018-12-08 23:48:47,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-08 23:48:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 303 transitions. [2018-12-08 23:48:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 23:48:47,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:48:47,862 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-08 23:48:47,862 INFO L423 AbstractCegarLoop]: === Iteration 30 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:48:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:48:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1218906967, now seen corresponding path program 1 times [2018-12-08 23:48:47,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:48:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:48:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:48:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:48:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:48:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:48:48,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:48:48,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:48:48,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:48:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:48:48,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:48:48,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 23:48:48,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 23:48:48,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,264 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 23:48:48,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 23:48:48,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 23:48:48,298 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 23:48:48,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 23:48:48,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 23:48:48,324 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 23:48:48,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,332 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 23:48:48,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-08 23:48:48,355 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 36 treesize of output 35 [2018-12-08 23:48:48,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-08 23:48:48,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,366 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 23:48:48,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:26 [2018-12-08 23:48:48,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 23:48:48,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,374 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 23:48:48,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2018-12-08 23:48:48,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-12-08 23:48:48,405 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 11 [2018-12-08 23:48:48,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-12-08 23:48:48,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-12-08 23:48:48,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:48:48,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:47, output treesize:33 [2018-12-08 23:48:48,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,483 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 51 treesize of output 55 [2018-12-08 23:48:48,484 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 23:48:48,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2018-12-08 23:48:48,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 55 [2018-12-08 23:48:48,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:48,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 37 treesize of output 36 [2018-12-08 23:48:48,544 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:48,575 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 23:48:48,575 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:92 [2018-12-08 23:48:48,680 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 82 treesize of output 72 [2018-12-08 23:48:48,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-12-08 23:48:48,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 103 [2018-12-08 23:48:48,742 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 88 treesize of output 93 [2018-12-08 23:48:48,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 106 [2018-12-08 23:48:48,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-08 23:48:48,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:48,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2018-12-08 23:48:48,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 20 treesize of output 25 [2018-12-08 23:48:48,890 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,896 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,938 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 90 treesize of output 73 [2018-12-08 23:48:48,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:48,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 23:48:48,941 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-12-08 23:48:48,958 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 20 treesize of output 25 [2018-12-08 23:48:48,958 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,966 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:48,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 23:48:48,996 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:176, output treesize:210 [2018-12-08 23:48:55,088 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2018-12-08 23:48:55,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 127 [2018-12-08 23:48:55,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 121 [2018-12-08 23:48:55,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-12-08 23:48:55,272 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 112 treesize of output 102 [2018-12-08 23:48:55,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 23:48:55,459 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 86 treesize of output 76 [2018-12-08 23:48:55,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:48:55,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,476 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-12-08 23:48:55,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:48:55,484 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 32 treesize of output 31 [2018-12-08 23:48:55,484 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-12-08 23:48:55,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:48:55,506 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 28 treesize of output 37 [2018-12-08 23:48:55,506 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,515 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 71 [2018-12-08 23:48:55,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:48:55,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-08 23:48:55,522 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,530 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,534 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 89 treesize of output 80 [2018-12-08 23:48:55,535 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:48:55,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-08 23:48:55,537 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,545 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,612 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 102 treesize of output 92 [2018-12-08 23:48:55,619 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 30 treesize of output 17 [2018-12-08 23:48:55,619 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,627 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-12-08 23:48:55,707 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 30 treesize of output 17 [2018-12-08 23:48:55,707 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,713 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:48:55,716 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 65 treesize of output 52 [2018-12-08 23:48:55,717 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:48:55,719 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 30 treesize of output 5 [2018-12-08 23:48:55,719 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,723 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-12-08 23:48:55,775 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:220, output treesize:245 [2018-12-08 23:48:55,835 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 23:48:55,836 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 23:48:55,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2018-12-08 23:48:55,868 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 23 treesize of output 24 [2018-12-08 23:48:55,869 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 23:48:55,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:48:55,878 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 23:48:55,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-12-08 23:49:00,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 69 [2018-12-08 23:49:00,051 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 23:49:00,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,129 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 39 treesize of output 50 [2018-12-08 23:49:00,129 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2018-12-08 23:49:00,160 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 23:49:00,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-08 23:49:00,206 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 23:49:00,207 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 23:49:00,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-12-08 23:49:00,232 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:61, output treesize:154 [2018-12-08 23:49:00,547 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-12-08 23:49:00,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 76 [2018-12-08 23:49:00,561 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 68 treesize of output 56 [2018-12-08 23:49:00,561 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 23:49:00,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 51 [2018-12-08 23:49:00,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 23:49:00,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,672 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 52 treesize of output 44 [2018-12-08 23:49:00,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 23:49:00,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,683 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 23:49:00,683 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:00,700 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:129, output treesize:45 [2018-12-08 23:49:00,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:00,750 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 44 [2018-12-08 23:49:00,752 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 38 treesize of output 40 [2018-12-08 23:49:00,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-12-08 23:49:00,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:00,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:00,775 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:39 [2018-12-08 23:49:00,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-12-08 23:49:00,862 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 23:49:00,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:00,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:00,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:00,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 68 [2018-12-08 23:49:00,899 INFO L478 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 37 treesize of output 73 [2018-12-08 23:49:00,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 23:49:00,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:00,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 23:49:00,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-12-08 23:49:00,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:00,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:01,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-12-08 23:49:01,004 INFO L478 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 10 treesize of output 15 [2018-12-08 23:49:01,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:01,009 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 25 treesize of output 14 [2018-12-08 23:49:01,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:01,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:01,026 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 37 treesize of output 29 [2018-12-08 23:49:01,027 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 9 [2018-12-08 23:49:01,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:01,032 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 23:49:01,032 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:01,035 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:01,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:01,043 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:74, output treesize:20 [2018-12-08 23:49:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:49:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:49:01,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 47 [2018-12-08 23:49:01,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-08 23:49:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-08 23:49:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2070, Unknown=3, NotChecked=0, Total=2256 [2018-12-08 23:49:01,082 INFO L87 Difference]: Start difference. First operand 266 states and 303 transitions. Second operand 48 states. [2018-12-08 23:49:02,548 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2018-12-08 23:49:05,028 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 129 DAG size of output: 73 [2018-12-08 23:49:06,998 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 145 DAG size of output: 75 [2018-12-08 23:49:09,234 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 138 DAG size of output: 76 [2018-12-08 23:49:28,891 WARN L180 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-12-08 23:49:32,725 WARN L180 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2018-12-08 23:49:39,157 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-12-08 23:49:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:49:39,445 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2018-12-08 23:49:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-08 23:49:39,445 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 56 [2018-12-08 23:49:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:49:39,446 INFO L225 Difference]: With dead ends: 272 [2018-12-08 23:49:39,446 INFO L226 Difference]: Without dead ends: 272 [2018-12-08 23:49:39,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=914, Invalid=6046, Unknown=12, NotChecked=0, Total=6972 [2018-12-08 23:49:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-08 23:49:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2018-12-08 23:49:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 23:49:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 302 transitions. [2018-12-08 23:49:39,452 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 302 transitions. Word has length 56 [2018-12-08 23:49:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:49:39,453 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 302 transitions. [2018-12-08 23:49:39,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-08 23:49:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 302 transitions. [2018-12-08 23:49:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 23:49:39,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:49:39,453 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-12-08 23:49:39,454 INFO L423 AbstractCegarLoop]: === Iteration 31 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:49:39,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:49:39,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1218906968, now seen corresponding path program 1 times [2018-12-08 23:49:39,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:49:39,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:49:39,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:49:39,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:49:39,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:49:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:49:39,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:49:39,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/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 23:49:39,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:49:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:49:39,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 23:49:39,979 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 23:49:39,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:39,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:39,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 23:49:39,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:39,983 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 23:49:39,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:39,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:39,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-12-08 23:49:40,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 23:49:40,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 23:49:40,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:40,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:51 [2018-12-08 23:49:40,102 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 40 treesize of output 37 [2018-12-08 23:49:40,104 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 23:49:40,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,113 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 42 treesize of output 39 [2018-12-08 23:49:40,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 23:49:40,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:40,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:83, output treesize:75 [2018-12-08 23:49:40,180 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 54 treesize of output 51 [2018-12-08 23:49:40,186 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 23:49:40,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,218 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 52 treesize of output 53 [2018-12-08 23:49:40,219 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 23:49:40,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,247 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 23:49:40,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:99 [2018-12-08 23:49:40,297 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 67 treesize of output 60 [2018-12-08 23:49:40,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,300 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 37 treesize of output 33 [2018-12-08 23:49:40,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,334 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 69 treesize of output 62 [2018-12-08 23:49:40,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,337 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 37 treesize of output 33 [2018-12-08 23:49:40,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,364 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 23:49:40,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:99 [2018-12-08 23:49:40,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-12-08 23:49:40,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,373 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 23:49:40,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:49:40,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:206, output treesize:63 [2018-12-08 23:49:40,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-12-08 23:49:40,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:49:40,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-12-08 23:49:40,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-12-08 23:49:40,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 23:49:40,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 23:49:40,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:75 [2018-12-08 23:49:40,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2018-12-08 23:49:40,594 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 23:49:40,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,623 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 44 treesize of output 57 [2018-12-08 23:49:40,624 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 23:49:40,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 23:49:40,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:97 [2018-12-08 23:49:40,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2018-12-08 23:49:40,850 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 20 treesize of output 25 [2018-12-08 23:49:40,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,964 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 57 treesize of output 64 [2018-12-08 23:49:40,971 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 20 treesize of output 25 [2018-12-08 23:49:40,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:40,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:41,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:49:41,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:139, output treesize:123 [2018-12-08 23:49:47,242 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-12-08 23:49:47,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2018-12-08 23:49:47,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:49:47,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 23:49:47,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:47,372 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 107 treesize of output 98 [2018-12-08 23:49:47,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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 21 [2018-12-08 23:49:47,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 23:49:47,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:49:47,396 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 101 treesize of output 92 [2018-12-08 23:49:47,397 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:49:47,398 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 32 treesize of output 31 [2018-12-08 23:49:47,398 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:47,408 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:47,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 23:49:47,440 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:177 [2018-12-08 23:49:47,505 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 33 treesize of output 25 [2018-12-08 23:49:47,507 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 25 treesize of output 14 [2018-12-08 23:49:47,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:47,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:47,522 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 23:49:47,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:63 [2018-12-08 23:49:47,582 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 38 treesize of output 47 [2018-12-08 23:49:47,583 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 23:49:47,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:49:47,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:49:47,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 23:49:47,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:72 [2018-12-08 23:50:03,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:03,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:03,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:03,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:03,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 60 [2018-12-08 23:50:03,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:03,876 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 23:50:03,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:03,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 23:50:03,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:121 [2018-12-08 23:50:03,962 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 23:50:03,963 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 19 [2018-12-08 23:50:03,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:03,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 142 [2018-12-08 23:50:04,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 23:50:04,032 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:04,032 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 112 treesize of output 78 [2018-12-08 23:50:04,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,481 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 103 treesize of output 114 [2018-12-08 23:50:04,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 23:50:04,539 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:140, output treesize:169 [2018-12-08 23:50:04,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:04,696 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 103 [2018-12-08 23:50:04,699 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 103 treesize of output 101 [2018-12-08 23:50:04,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,728 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:04,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:04,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 90 [2018-12-08 23:50:04,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:50:04,805 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:04,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 139 treesize of output 154 [2018-12-08 23:50:04,830 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 159 treesize of output 144 [2018-12-08 23:50:04,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:04,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 23:50:04,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:04,940 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 4 new quantified variables, introduced 12 case distinctions, treesize of input 175 treesize of output 231 [2018-12-08 23:50:04,941 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 23:50:04,958 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 212 treesize of output 211 [2018-12-08 23:50:04,958 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:05,412 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:05,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-08 23:50:05,459 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:215, output treesize:356 [2018-12-08 23:50:05,782 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 23:50:05,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:05,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:05,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:05,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:05,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:05,819 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:05,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:05,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 275 [2018-12-08 23:50:05,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:05,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:05,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 167 treesize of output 221 [2018-12-08 23:50:05,938 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 23:50:05,950 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 23:50:05,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:06,300 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 154 treesize of output 159 [2018-12-08 23:50:06,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:06,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:06,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:06,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:06,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:06,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 109 [2018-12-08 23:50:06,810 INFO L478 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 41 treesize of output 78 [2018-12-08 23:50:06,811 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 23:50:06,829 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:06,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 23:50:06,853 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 14 variables, input treesize:458, output treesize:204 [2018-12-08 23:50:06,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:06,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:06,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 135 [2018-12-08 23:50:06,939 INFO L478 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 26 treesize of output 66 [2018-12-08 23:50:06,940 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 23:50:06,948 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 110 treesize of output 37 [2018-12-08 23:50:06,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:06,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:06,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 150 [2018-12-08 23:50:06,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 23:50:07,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:07,027 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:07,027 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 118 treesize of output 130 [2018-12-08 23:50:07,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2018-12-08 23:50:10,275 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 23:50:12,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:12,888 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 102 treesize of output 60 [2018-12-08 23:50:12,888 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:15,452 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 39 [2018-12-08 23:50:15,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:18,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:18,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:18,038 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 39 treesize of output 32 [2018-12-08 23:50:18,038 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:20,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:20,103 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 83 treesize of output 51 [2018-12-08 23:50:20,103 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:22,026 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 98 treesize of output 66 [2018-12-08 23:50:22,027 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 23:50:24,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2018-12-08 23:50:24,003 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:25,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-12-08 23:50:25,931 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:27,871 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 53 treesize of output 42 [2018-12-08 23:50:27,871 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:29,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:29,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2018-12-08 23:50:29,794 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:31,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:31,686 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:31,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 48 [2018-12-08 23:50:31,687 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:33,560 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 12 [2018-12-08 23:50:33,561 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:36,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:36,340 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:36,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 48 [2018-12-08 23:50:36,340 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:37,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:37,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-08 23:50:37,220 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:42,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:42,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:42,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:42,410 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:42,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2018-12-08 23:50:42,411 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:46,362 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 71 treesize of output 52 [2018-12-08 23:50:46,363 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:46,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 23:50:46,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 23:50:46,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 21 [2018-12-08 23:50:46,576 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 23:50:46,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 139 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:46,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 23:50:46,708 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:261, output treesize:13 [2018-12-08 23:50:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:50:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 23:50:46,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 48 [2018-12-08 23:50:46,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-08 23:50:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-08 23:50:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2079, Unknown=10, NotChecked=0, Total=2352 [2018-12-08 23:50:46,787 INFO L87 Difference]: Start difference. First operand 266 states and 302 transitions. Second operand 49 states. [2018-12-08 23:50:47,942 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-08 23:50:48,292 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-12-08 23:50:48,855 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-12-08 23:50:52,841 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 149 DAG size of output: 102 [2018-12-08 23:51:00,408 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2018-12-08 23:51:01,016 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2018-12-08 23:51:02,371 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2018-12-08 23:51:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:51:03,488 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2018-12-08 23:51:03,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-08 23:51:03,488 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 56 [2018-12-08 23:51:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:51:03,489 INFO L225 Difference]: With dead ends: 269 [2018-12-08 23:51:03,489 INFO L226 Difference]: Without dead ends: 269 [2018-12-08 23:51:03,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2161 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=1158, Invalid=7022, Unknown=10, NotChecked=0, Total=8190 [2018-12-08 23:51:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-08 23:51:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-12-08 23:51:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 23:51:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 301 transitions. [2018-12-08 23:51:03,493 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 301 transitions. Word has length 56 [2018-12-08 23:51:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:51:03,493 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 301 transitions. [2018-12-08 23:51:03,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-08 23:51:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 301 transitions. [2018-12-08 23:51:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 23:51:03,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:51:03,493 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:51:03,494 INFO L423 AbstractCegarLoop]: === Iteration 32 === [create_treeErr7REQUIRES_VIOLATION, create_treeErr9REQUIRES_VIOLATION, create_treeErr8REQUIRES_VIOLATION, create_treeErr10REQUIRES_VIOLATION, create_treeErr11REQUIRES_VIOLATION, create_treeErr2REQUIRES_VIOLATION, create_treeErr23REQUIRES_VIOLATION, create_treeErr3REQUIRES_VIOLATION, create_treeErr25REQUIRES_VIOLATION, create_treeErr24REQUIRES_VIOLATION, create_treeErr26REQUIRES_VIOLATION, create_treeErr4REQUIRES_VIOLATION, create_treeErr5REQUIRES_VIOLATION, create_treeErr6REQUIRES_VIOLATION, create_treeErr27REQUIRES_VIOLATION, create_treeErr18REQUIRES_VIOLATION, create_treeErr19REQUIRES_VIOLATION, create_treeErr21REQUIRES_VIOLATION, create_treeErr20REQUIRES_VIOLATION, create_treeErr22REQUIRES_VIOLATION, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION, create_treeErr13REQUIRES_VIOLATION, create_treeErr12REQUIRES_VIOLATION, create_treeErr14REQUIRES_VIOLATION, create_treeErr15REQUIRES_VIOLATION, create_treeErr17REQUIRES_VIOLATION, create_treeErr16REQUIRES_VIOLATION, inspectErr9REQUIRES_VIOLATION, inspectErr8REQUIRES_VIOLATION, inspectErr3REQUIRES_VIOLATION, inspectErr2REQUIRES_VIOLATION, inspectErr7REQUIRES_VIOLATION, inspectErr6REQUIRES_VIOLATION, inspectErr1REQUIRES_VIOLATION, inspectErr0REQUIRES_VIOLATION, inspectErr5REQUIRES_VIOLATION, inspectErr4REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, free_treeErr11REQUIRES_VIOLATION, free_treeErr0REQUIRES_VIOLATION, free_treeErr18ASSERT_VIOLATIONMEMORY_FREE, free_treeErr1REQUIRES_VIOLATION, free_treeErr9ASSERT_VIOLATIONMEMORY_FREE, free_treeErr10REQUIRES_VIOLATION, free_treeErr19ASSERT_VIOLATIONMEMORY_FREE, free_treeErr8ASSERT_VIOLATIONMEMORY_FREE, free_treeErr7REQUIRES_VIOLATION, free_treeErr15ASSERT_VIOLATIONMEMORY_FREE, free_treeErr14ASSERT_VIOLATIONMEMORY_FREE, free_treeErr17REQUIRES_VIOLATION, free_treeErr16REQUIRES_VIOLATION, free_treeErr6REQUIRES_VIOLATION, free_treeErr4REQUIRES_VIOLATION, free_treeErr5REQUIRES_VIOLATION, free_treeErr3REQUIRES_VIOLATION, free_treeErr12REQUIRES_VIOLATION, free_treeErr13REQUIRES_VIOLATION, free_treeErr2REQUIRES_VIOLATION]=== [2018-12-08 23:51:03,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:51:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1766635303, now seen corresponding path program 1 times [2018-12-08 23:51:03,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 23:51:03,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 23:51:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:51:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:51:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:51:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:51:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:51:03,527 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 23:51:03,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:51:03 BoogieIcfgContainer [2018-12-08 23:51:03,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 23:51:03,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 23:51:03,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 23:51:03,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 23:51:03,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:45:53" (3/4) ... [2018-12-08 23:51:03,554 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 23:51:03,588 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2edcf877-4b69-4676-af93-072aec2bff88/bin-2019/uautomizer/witness.graphml [2018-12-08 23:51:03,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 23:51:03,588 INFO L168 Benchmark]: Toolchain (without parser) took 310730.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -103.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:51:03,589 INFO L168 Benchmark]: CDTParser took 0.14 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 23:51:03,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:03,589 INFO L168 Benchmark]: Boogie Preprocessor took 43.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:03,589 INFO L168 Benchmark]: RCFGBuilder took 370.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:03,589 INFO L168 Benchmark]: TraceAbstraction took 309989.63 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -33.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:51:03,589 INFO L168 Benchmark]: Witness Printer took 36.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 23:51:03,590 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -148.1 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 309989.63 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -33.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 36.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 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: - CounterExampleResult [Line: 566]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L619] CALL, EXPR create_tree() [L574] struct node *nodelast = ((void *)0); [L575] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L576] COND TRUE __VERIFIER_nondet_int() [L577] node = malloc(sizeof *node) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L578] COND FALSE !(!node) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L580] node->left = ((void *)0) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L581] node->right = nodelast VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L582] COND FALSE !(\read(*nodelast)) VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}] [L584] int value = __VERIFIER_nondet_int(); [L585] node->value = value VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={0:0}, value=42] [L586] nodelast = node VAL [malloc(sizeof *node)={54:0}, node={54:0}, nodelast={54:0}, value=42] [L576] COND FALSE !(__VERIFIER_nondet_int()) [L588] COND TRUE node != ((void *)0) [L589] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, nodelast={54:0}, value=42] [L590] COND FALSE !(!node) VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, nodelast={54:0}, value=42] [L592] EXPR node->left VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L592] node->left->left = ((void *)0) VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L593] EXPR node->left VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L593] node->left->right = ((void *)0) VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L594] EXPR node->left VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L594] node->left->value = 42 VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L595] EXPR node->left VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L595] node->left->parent = node VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->left={55:0}, nodelast={54:0}, value=42] [L596] EXPR node->right VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={54:0}, node->right={0:0}, nodelast={54:0}, value=42] [L596] node = node->right [L588] COND FALSE !(node != ((void *)0)) VAL [malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={0:0}, nodelast={54:0}, value=42] [L598] return nodelast; VAL [\result={54:0}, malloc(sizeof *node)={55:0}, malloc(sizeof *node)={54:0}, node={0:0}, nodelast={54:0}, value=42] [L619] RET, EXPR create_tree() VAL [create_tree()={54:0}] [L619] struct node *data = create_tree(); [L620] COND FALSE !(!data) VAL [data={54:0}] [L622] CALL inspect(data) VAL [node={54:0}] [L564] COND FALSE !(!(node)) VAL [node={54:0}, node={54:0}] [L565] COND TRUE node != ((void *)0) VAL [node={54:0}, node={54:0}] [L566] node->left VAL [node={54:0}, node={54:0}, node->left={55:0}] [L566] COND TRUE node->left [L567] EXPR node->left VAL [node={54:0}, node={54:0}, node->left={55:0}] [L567] EXPR node->left->value VAL [node={54:0}, node={54:0}, node->left={55:0}, node->left->value=42] [L567] COND FALSE !(!(node->left->value == 42)) [L568] EXPR node->value VAL [node={54:0}, node={54:0}, node->value=42] [L568] COND FALSE !(!(node->value)) [L569] EXPR node->parent VAL [node={54:0}, node={54:0}, node->parent={52:53}] [L569] node = node->parent [L565] COND TRUE node != ((void *)0) VAL [node={54:0}, node={52:53}] [L566] node->left - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 158 locations, 59 error locations. UNSAFE Result, 309.9s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 174.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3547 SDtfs, 3941 SDslu, 17338 SDs, 0 SdLazy, 18087 SolverSat, 851 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 47.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1331 GetRequests, 510 SyntacticMatches, 76 SemanticMatches, 745 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10216 ImplicationChecksByTransitivity, 210.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=26, 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, 31 MinimizatonAttempts, 310 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 134.1s InterpolantComputationTime, 1716 NumberOfCodeBlocks, 1716 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1612 ConstructedInterpolants, 243 QuantifiedInterpolants, 1521584 SizeOfPredicates, 244 NumberOfNonLiveVariables, 3327 ConjunctsInSsa, 597 ConjunctsInUnsatCore, 45 InterpolantComputations, 17 PerfectInterpolantSequences, 147/323 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...