./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.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_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/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 0116566dfd4e4e63b59200ee97d098541aa6c54d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:29:48,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:29:48,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:29:48,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:29:48,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:29:48,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:29:48,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:29:48,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:29:48,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:29:48,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:29:48,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:29:48,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:29:48,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:29:48,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:29:48,988 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:29:48,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:29:48,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:29:48,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:29:48,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:29:48,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:29:48,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:29:48,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:29:48,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:29:48,993 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:29:48,994 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:29:48,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:29:48,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:29:48,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:29:48,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:29:48,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:29:48,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:29:48,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:29:48,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:29:48,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:29:48,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:29:48,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:29:48,997 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 15:29:49,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:29:49,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:29:49,004 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:29:49,005 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:29:49,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:29:49,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:29:49,005 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:29:49,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:29:49,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:29:49,005 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:29:49,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:29:49,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:29:49,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:29:49,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:29:49,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:29:49,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:29:49,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:29:49,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:29:49,007 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:29:49,007 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_f7b8b2a7-be12-4773-b75b-b7a508810aa7/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 -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-12-09 15:29:49,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:29:49,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:29:49,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:29:49,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:29:49,033 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:29:49,033 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-09 15:29:49,068 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/data/95d84f304/12e4914999af4c7aa397fdb47a4fe10f/FLAG6916be68f [2018-12-09 15:29:49,365 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:29:49,365 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-12-09 15:29:49,372 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/data/95d84f304/12e4914999af4c7aa397fdb47a4fe10f/FLAG6916be68f [2018-12-09 15:29:49,380 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/data/95d84f304/12e4914999af4c7aa397fdb47a4fe10f [2018-12-09 15:29:49,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:29:49,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 15:29:49,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:29:49,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:29:49,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:29:49,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3ff299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49, skipping insertion in model container [2018-12-09 15:29:49,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:29:49,411 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:29:49,552 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:29:49,558 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:29:49,613 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:29:49,641 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:29:49,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49 WrapperNode [2018-12-09 15:29:49,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:29:49,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:29:49,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:29:49,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:29:49,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... [2018-12-09 15:29:49,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:29:49,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:29:49,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:29:49,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:29:49,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:29:49,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:29:49,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:29:49,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-09 15:29:49,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-09 15:29:49,701 INFO L138 BoogieDeclarations]: Found implementation of procedure substring [2018-12-09 15:29:49,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-09 15:29:49,701 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-09 15:29:49,702 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-09 15:29:49,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-09 15:29:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-09 15:29:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-09 15:29:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-09 15:29:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure substring [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:29:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:29:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:29:49,914 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:29:49,914 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 15:29:49,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:29:49 BoogieIcfgContainer [2018-12-09 15:29:49,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:29:49,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:29:49,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:29:49,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:29:49,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:29:49" (1/3) ... [2018-12-09 15:29:49,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4bd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:29:49, skipping insertion in model container [2018-12-09 15:29:49,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:29:49" (2/3) ... [2018-12-09 15:29:49,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4bd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:29:49, skipping insertion in model container [2018-12-09 15:29:49,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:29:49" (3/3) ... [2018-12-09 15:29:49,919 INFO L112 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-12-09 15:29:49,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:29:49,929 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 15:29:49,939 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 15:29:49,953 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:29:49,953 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:29:49,953 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 15:29:49,953 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:29:49,953 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:29:49,954 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:29:49,954 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:29:49,954 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:29:49,954 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:29:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-09 15:29:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 15:29:49,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:49,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:49,969 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:49,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash 386859026, now seen corresponding path program 1 times [2018-12-09 15:29:49,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:49,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:29:50,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:29:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:29:50,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:29:50,095 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-12-09 15:29:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,127 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-09 15:29:50,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:29:50,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 15:29:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,134 INFO L225 Difference]: With dead ends: 46 [2018-12-09 15:29:50,134 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 15:29:50,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:29:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 15:29:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 15:29:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 15:29:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 15:29:50,156 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 10 [2018-12-09 15:29:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,156 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 15:29:50,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:29:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 15:29:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 15:29:50,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 386859027, now seen corresponding path program 1 times [2018-12-09 15:29:50,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:29:50,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:29:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:29:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:29:50,198 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-09 15:29:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,214 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 15:29:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:29:50,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 15:29:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,214 INFO L225 Difference]: With dead ends: 42 [2018-12-09 15:29:50,215 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 15:29:50,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:29:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 15:29:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 15:29:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 15:29:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 15:29:50,218 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-12-09 15:29:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,218 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 15:29:50,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:29:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 15:29:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:29:50,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,218 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash -892272091, now seen corresponding path program 1 times [2018-12-09 15:29:50,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:29:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:29:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:29:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:29:50,238 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-09 15:29:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,257 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-09 15:29:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:29:50,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 15:29:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,257 INFO L225 Difference]: With dead ends: 41 [2018-12-09 15:29:50,257 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 15:29:50,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:29:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 15:29:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 15:29:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 15:29:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-09 15:29:50,260 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2018-12-09 15:29:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,260 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 15:29:50,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:29:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-09 15:29:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:29:50,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,261 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash -892272090, now seen corresponding path program 1 times [2018-12-09 15:29:50,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:29:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:29:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:29:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:29:50,301 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-12-09 15:29:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,312 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 15:29:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:29:50,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 15:29:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,313 INFO L225 Difference]: With dead ends: 40 [2018-12-09 15:29:50,313 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 15:29:50,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:29:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 15:29:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 15:29:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 15:29:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 15:29:50,317 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 11 [2018-12-09 15:29:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,317 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 15:29:50,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:29:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 15:29:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:29:50,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -125213255, now seen corresponding path program 1 times [2018-12-09 15:29:50,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:29:50,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:29:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:29:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:29:50,353 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-12-09 15:29:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,395 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-09 15:29:50,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:29:50,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 15:29:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,396 INFO L225 Difference]: With dead ends: 39 [2018-12-09 15:29:50,396 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 15:29:50,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:29:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 15:29:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 15:29:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 15:29:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-09 15:29:50,398 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-12-09 15:29:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,398 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-09 15:29:50,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:29:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-09 15:29:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:29:50,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,399 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash -125213254, now seen corresponding path program 1 times [2018-12-09 15:29:50,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:29:50,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:29:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:29:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:29:50,444 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-12-09 15:29:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,504 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-09 15:29:50,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:29:50,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 15:29:50,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,506 INFO L225 Difference]: With dead ends: 61 [2018-12-09 15:29:50,506 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 15:29:50,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:29:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 15:29:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2018-12-09 15:29:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 15:29:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 15:29:50,510 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-09 15:29:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,510 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 15:29:50,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:29:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 15:29:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 15:29:50,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -70853378, now seen corresponding path program 1 times [2018-12-09 15:29:50,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:29:50,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:29:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:29:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:29:50,537 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 6 states. [2018-12-09 15:29:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,587 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-12-09 15:29:50,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:29:50,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 15:29:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,588 INFO L225 Difference]: With dead ends: 41 [2018-12-09 15:29:50,588 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 15:29:50,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:29:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 15:29:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-12-09 15:29:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 15:29:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-12-09 15:29:50,590 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 16 [2018-12-09 15:29:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,590 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-12-09 15:29:50,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:29:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-12-09 15:29:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 15:29:50,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,591 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash -70853377, now seen corresponding path program 1 times [2018-12-09 15:29:50,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:29:50,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:29:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:29:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:29:50,641 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2018-12-09 15:29:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,718 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-12-09 15:29:50,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:29:50,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-09 15:29:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,720 INFO L225 Difference]: With dead ends: 54 [2018-12-09 15:29:50,720 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 15:29:50,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:29:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 15:29:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-09 15:29:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 15:29:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-12-09 15:29:50,724 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2018-12-09 15:29:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,724 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-09 15:29:50,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:29:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-12-09 15:29:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:29:50,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,725 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -779049943, now seen corresponding path program 1 times [2018-12-09 15:29:50,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:29:50,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:29:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:29:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:29:50,768 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-12-09 15:29:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,802 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 15:29:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:29:50,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 15:29:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,803 INFO L225 Difference]: With dead ends: 44 [2018-12-09 15:29:50,803 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 15:29:50,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:29:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 15:29:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 15:29:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 15:29:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-12-09 15:29:50,805 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 20 [2018-12-09 15:29:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,805 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-12-09 15:29:50,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:29:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-12-09 15:29:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:29:50,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,805 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash -755130684, now seen corresponding path program 1 times [2018-12-09 15:29:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:29:50,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:29:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:29:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:29:50,833 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-12-09 15:29:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:50,895 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-09 15:29:50,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:29:50,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 15:29:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:50,896 INFO L225 Difference]: With dead ends: 39 [2018-12-09 15:29:50,896 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 15:29:50,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:29:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 15:29:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-09 15:29:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 15:29:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-09 15:29:50,898 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-12-09 15:29:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:50,898 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-09 15:29:50,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:29:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-09 15:29:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:29:50,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:50,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:50,899 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:50,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash -755130683, now seen corresponding path program 1 times [2018-12-09 15:29:50,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:50,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:50,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:50,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:29:50,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:29:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:29:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:29:50,940 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-12-09 15:29:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:51,002 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-12-09 15:29:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:29:51,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 15:29:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:51,003 INFO L225 Difference]: With dead ends: 64 [2018-12-09 15:29:51,003 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 15:29:51,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:29:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 15:29:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-12-09 15:29:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 15:29:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 15:29:51,010 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 20 [2018-12-09 15:29:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:51,010 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 15:29:51,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:29:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 15:29:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:29:51,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:51,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:51,011 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:51,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -755121610, now seen corresponding path program 1 times [2018-12-09 15:29:51,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:51,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:51,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:51,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:29:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:29:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:29:51,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:29:51,023 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-12-09 15:29:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:51,028 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-09 15:29:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:29:51,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 15:29:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:51,029 INFO L225 Difference]: With dead ends: 46 [2018-12-09 15:29:51,029 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 15:29:51,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:29:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 15:29:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 15:29:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 15:29:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 15:29:51,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 20 [2018-12-09 15:29:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:51,032 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 15:29:51,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:29:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 15:29:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:29:51,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:51,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:51,033 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:51,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash 177570790, now seen corresponding path program 1 times [2018-12-09 15:29:51,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:51,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:51,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:51,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:29:51,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:29:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:29:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:29:51,065 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-09 15:29:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:51,116 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-09 15:29:51,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:29:51,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 15:29:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:51,116 INFO L225 Difference]: With dead ends: 50 [2018-12-09 15:29:51,117 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 15:29:51,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:29:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 15:29:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-09 15:29:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 15:29:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-09 15:29:51,119 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-12-09 15:29:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:51,120 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-09 15:29:51,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:29:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-09 15:29:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:29:51,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:51,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:51,121 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:51,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash 940519430, now seen corresponding path program 1 times [2018-12-09 15:29:51,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:51,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 15:29:51,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 15:29:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 15:29:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:29:51,252 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 14 states. [2018-12-09 15:29:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:51,461 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-12-09 15:29:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 15:29:51,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-12-09 15:29:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:51,461 INFO L225 Difference]: With dead ends: 92 [2018-12-09 15:29:51,461 INFO L226 Difference]: Without dead ends: 92 [2018-12-09 15:29:51,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-09 15:29:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-09 15:29:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2018-12-09 15:29:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 15:29:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-09 15:29:51,464 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-12-09 15:29:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:51,464 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-09 15:29:51,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 15:29:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-09 15:29:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:29:51,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:51,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:51,465 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:51,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -647828472, now seen corresponding path program 1 times [2018-12-09 15:29:51,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:51,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:51,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 15:29:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 15:29:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 15:29:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:29:51,540 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 10 states. [2018-12-09 15:29:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:51,613 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-09 15:29:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:29:51,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 15:29:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:51,614 INFO L225 Difference]: With dead ends: 81 [2018-12-09 15:29:51,614 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 15:29:51,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:29:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 15:29:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 15:29:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 15:29:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-12-09 15:29:51,617 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 23 [2018-12-09 15:29:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:51,617 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-12-09 15:29:51,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 15:29:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-12-09 15:29:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:29:51,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:51,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:51,618 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:51,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1668896826, now seen corresponding path program 1 times [2018-12-09 15:29:51,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:51,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:51,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:51,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:51,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:51,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:51,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:29:51,804 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 14 treesize of output 11 [2018-12-09 15:29:51,806 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 11 treesize of output 10 [2018-12-09 15:29:51,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:51,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:51,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:29:51,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 15:29:51,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 15:29:51,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 15:29:51,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 15:29:51,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:51,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:51,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 15:29:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:51,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:29:51,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-12-09 15:29:51,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 15:29:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 15:29:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:29:51,990 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 19 states. [2018-12-09 15:29:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:52,535 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-09 15:29:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 15:29:52,535 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-12-09 15:29:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:52,536 INFO L225 Difference]: With dead ends: 81 [2018-12-09 15:29:52,536 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 15:29:52,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-09 15:29:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 15:29:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-12-09 15:29:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 15:29:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-12-09 15:29:52,538 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 23 [2018-12-09 15:29:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:52,538 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-12-09 15:29:52,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 15:29:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-12-09 15:29:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:29:52,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:52,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:52,539 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:52,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -98139660, now seen corresponding path program 1 times [2018-12-09 15:29:52,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:52,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:52,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:29:52,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:29:52,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:29:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:29:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:29:52,605 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 8 states. [2018-12-09 15:29:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:52,652 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-12-09 15:29:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:29:52,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-09 15:29:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:52,653 INFO L225 Difference]: With dead ends: 61 [2018-12-09 15:29:52,653 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 15:29:52,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:29:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 15:29:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-09 15:29:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 15:29:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-09 15:29:52,655 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 25 [2018-12-09 15:29:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:52,656 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-09 15:29:52,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:29:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-09 15:29:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:29:52,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:52,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:52,656 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:52,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1787083402, now seen corresponding path program 1 times [2018-12-09 15:29:52,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:52,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:52,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:52,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:52,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:52,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:52,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:52,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:29:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:29:52,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 15:29:52,820 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 14 treesize of output 11 [2018-12-09 15:29:52,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 11 treesize of output 10 [2018-12-09 15:29:52,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:29:52,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 15:29:52,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 15:29:52,846 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 11 treesize of output 10 [2018-12-09 15:29:52,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,856 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-09 15:29:52,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 15:29:52,928 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-09 15:29:52,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 15:29:52,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 15:29:52,943 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 8 treesize of output 1 [2018-12-09 15:29:52,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:52,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:52,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:52,954 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-09 15:29:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:29:53,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-09 15:29:53,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 15:29:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 15:29:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-12-09 15:29:53,012 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 17 states. [2018-12-09 15:29:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:53,454 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-12-09 15:29:53,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:29:53,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-12-09 15:29:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:53,455 INFO L225 Difference]: With dead ends: 110 [2018-12-09 15:29:53,455 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 15:29:53,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-12-09 15:29:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 15:29:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-12-09 15:29:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 15:29:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2018-12-09 15:29:53,457 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 25 [2018-12-09 15:29:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:53,458 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2018-12-09 15:29:53,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 15:29:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2018-12-09 15:29:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 15:29:53,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:53,458 INFO L402 BasicCegarLoop]: trace histogram [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-09 15:29:53,458 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:53,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:53,458 INFO L82 PathProgramCache]: Analyzing trace with hash 633122316, now seen corresponding path program 1 times [2018-12-09 15:29:53,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:53,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:53,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:53,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:53,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:53,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:53,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:53,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:53,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:29:53,686 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 5 treesize of output 1 [2018-12-09 15:29:53,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:53,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:53,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 15:29:53,701 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 14 treesize of output 11 [2018-12-09 15:29:53,703 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 11 treesize of output 10 [2018-12-09 15:29:53,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:53,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:53,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:29:53,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 15:29:53,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 15:29:53,732 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 11 treesize of output 10 [2018-12-09 15:29:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:53,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:53,742 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-09 15:29:53,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 15:29:54,487 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 15:29:54,587 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 43 treesize of output 53 [2018-12-09 15:29:54,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-12-09 15:29:54,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-09 15:29:54,659 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 33 [2018-12-09 15:29:54,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:54,719 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-09 15:29:54,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-09 15:29:54,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2018-12-09 15:29:54,790 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 15:29:54,862 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 27 treesize of output 20 [2018-12-09 15:29:54,862 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:54,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 15:29:54,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:54,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-09 15:29:54,929 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:54,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 35 treesize of output 27 [2018-12-09 15:29:54,931 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:54,932 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 34 treesize of output 26 [2018-12-09 15:29:54,933 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:54,992 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 37 treesize of output 29 [2018-12-09 15:29:54,993 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:55,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-09 15:29:55,055 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-09 15:29:55,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 15:29:55,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:29:55,152 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-09 15:29:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:55,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:29:55,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-12-09 15:29:55,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 15:29:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 15:29:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2018-12-09 15:29:55,244 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 27 states. [2018-12-09 15:29:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:57,108 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-09 15:29:57,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 15:29:57,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-09 15:29:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:57,110 INFO L225 Difference]: With dead ends: 86 [2018-12-09 15:29:57,110 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 15:29:57,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 15:29:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 15:29:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-12-09 15:29:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 15:29:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2018-12-09 15:29:57,117 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 27 [2018-12-09 15:29:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:57,118 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2018-12-09 15:29:57,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 15:29:57,118 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2018-12-09 15:29:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 15:29:57,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:57,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:57,120 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:57,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2145519455, now seen corresponding path program 2 times [2018-12-09 15:29:57,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:57,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:57,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:57,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:57,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:29:57,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:29:57,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:29:57,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:29:57,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:29:57,355 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 12 treesize of output 15 [2018-12-09 15:29:57,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 15:29:57,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:57,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:57,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 15:29:57,385 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 16 treesize of output 13 [2018-12-09 15:29:57,386 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 13 treesize of output 12 [2018-12-09 15:29:57,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:57,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:57,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:57,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 15:29:57,490 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 20 treesize of output 16 [2018-12-09 15:29:57,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 15:29:57,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 15:29:57,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:57,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:29:57,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-12-09 15:29:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:57,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:29:57,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-09 15:29:57,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 15:29:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 15:29:57,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:29:57,594 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 20 states. [2018-12-09 15:29:58,008 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2018-12-09 15:29:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:58,551 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-12-09 15:29:58,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:29:58,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-12-09 15:29:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:58,553 INFO L225 Difference]: With dead ends: 86 [2018-12-09 15:29:58,553 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 15:29:58,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2018-12-09 15:29:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 15:29:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2018-12-09 15:29:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 15:29:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-09 15:29:58,558 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-12-09 15:29:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:58,558 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-09 15:29:58,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 15:29:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-09 15:29:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 15:29:58,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:58,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:58,560 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:58,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1646280319, now seen corresponding path program 1 times [2018-12-09 15:29:58,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:58,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:58,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:29:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:58,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:58,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:58,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:58,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:29:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:58,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:29:58,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2018-12-09 15:29:58,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:29:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:29:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:29:58,656 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-12-09 15:29:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:29:58,719 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-12-09 15:29:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:29:58,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-12-09 15:29:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:29:58,720 INFO L225 Difference]: With dead ends: 63 [2018-12-09 15:29:58,720 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 15:29:58,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:29:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 15:29:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-12-09 15:29:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 15:29:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-09 15:29:58,722 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 31 [2018-12-09 15:29:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:29:58,722 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-09 15:29:58,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:29:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-09 15:29:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:29:58,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:29:58,722 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:29:58,723 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:29:58,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:29:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash 649894181, now seen corresponding path program 2 times [2018-12-09 15:29:58,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:29:58,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:29:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:58,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:29:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:29:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:29:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:29:59,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:29:59,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:29:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:29:59,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:29:59,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:29:59,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:29:59,064 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 5 treesize of output 1 [2018-12-09 15:29:59,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:59,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:59,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 15:29:59,081 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 14 treesize of output 11 [2018-12-09 15:29:59,083 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 11 treesize of output 10 [2018-12-09 15:29:59,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:59,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:59,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:29:59,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 15:29:59,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 15:29:59,115 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 11 treesize of output 10 [2018-12-09 15:29:59,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:29:59,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:29:59,129 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-09 15:29:59,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-12-09 15:30:00,013 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 15:30:01,159 WARN L180 SmtUtils]: Spent 785.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-09 15:30:01,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 91 [2018-12-09 15:30:01,310 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 63 treesize of output 56 [2018-12-09 15:30:01,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:02,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:02,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 96 [2018-12-09 15:30:02,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-12-09 15:30:02,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2018-12-09 15:30:02,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:03,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:03,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 124 [2018-12-09 15:30:03,763 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 15:30:03,767 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 24 xjuncts. [2018-12-09 15:30:04,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:04,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 124 [2018-12-09 15:30:04,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 15:30:04,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 24 xjuncts. [2018-12-09 15:30:05,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:05,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 81 [2018-12-09 15:30:05,707 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-12-09 15:30:06,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:06,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 120 [2018-12-09 15:30:06,600 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 15:30:06,604 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 30 xjuncts. [2018-12-09 15:30:07,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:07,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 63 [2018-12-09 15:30:07,628 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:07,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:07,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:07,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:07,635 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 1 case distinctions, treesize of input 50 treesize of output 55 [2018-12-09 15:30:07,636 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:08,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:08,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 120 [2018-12-09 15:30:08,454 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 15:30:08,457 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 24 xjuncts. [2018-12-09 15:30:09,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:09,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:09,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:09,913 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 1 case distinctions, treesize of input 63 treesize of output 66 [2018-12-09 15:30:09,914 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:11,273 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 56 treesize of output 48 [2018-12-09 15:30:11,274 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:11,275 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 53 treesize of output 45 [2018-12-09 15:30:11,275 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:12,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-12-09 15:30:12,112 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:14,351 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 63 treesize of output 55 [2018-12-09 15:30:14,351 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:15,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:15,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 63 [2018-12-09 15:30:15,388 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:16,083 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 46 treesize of output 39 [2018-12-09 15:30:16,083 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:16,085 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 49 treesize of output 42 [2018-12-09 15:30:16,086 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:16,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-12-09 15:30:16,736 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:17,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:17,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 94 [2018-12-09 15:30:17,389 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 28 xjuncts. [2018-12-09 15:30:18,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:18,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 94 [2018-12-09 15:30:18,241 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 28 xjuncts. [2018-12-09 15:30:19,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-12-09 15:30:19,079 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:20,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:20,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 116 [2018-12-09 15:30:20,162 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 15:30:20,174 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 28 xjuncts. [2018-12-09 15:30:22,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:22,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 90 [2018-12-09 15:30:22,905 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 28 xjuncts. [2018-12-09 15:30:23,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:23,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 96 [2018-12-09 15:30:23,766 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-12-09 15:30:26,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2018-12-09 15:30:26,097 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:26,098 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 61 treesize of output 54 [2018-12-09 15:30:26,098 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:27,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:27,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:27,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:27,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 85 [2018-12-09 15:30:27,057 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 8 xjuncts. [2018-12-09 15:30:27,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-12-09 15:30:27,896 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:27,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-09 15:30:27,898 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:27,899 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 64 treesize of output 56 [2018-12-09 15:30:27,900 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:27,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-09 15:30:27,901 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:27,903 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 55 treesize of output 47 [2018-12-09 15:30:27,903 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:28,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:28,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:28,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:28,428 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 1 case distinctions, treesize of input 59 treesize of output 68 [2018-12-09 15:30:28,428 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:28,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 54 [2018-12-09 15:30:28,960 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:28,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 57 [2018-12-09 15:30:28,968 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:29,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-12-09 15:30:29,986 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:29,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-12-09 15:30:29,988 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:30,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:30,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 77 [2018-12-09 15:30:30,443 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-12-09 15:30:30,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-12-09 15:30:30,913 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:31,917 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 53 treesize of output 45 [2018-12-09 15:30:31,918 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:31,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-12-09 15:30:31,919 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:32,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:32,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:32,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:32,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 81 [2018-12-09 15:30:32,398 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-12-09 15:30:32,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-12-09 15:30:32,938 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:32,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-09 15:30:32,940 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:33,450 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 61 treesize of output 58 [2018-12-09 15:30:33,451 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:33,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:33,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:33,454 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 51 treesize of output 45 [2018-12-09 15:30:33,454 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:33,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:33,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:33,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-09 15:30:33,457 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:33,458 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 58 treesize of output 55 [2018-12-09 15:30:33,459 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:33,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-12-09 15:30:33,461 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:35,436 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 67 treesize of output 60 [2018-12-09 15:30:35,436 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:35,826 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 1 case distinctions, treesize of input 55 treesize of output 59 [2018-12-09 15:30:35,827 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:36,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-12-09 15:30:36,214 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:36,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:36,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:36,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:36,610 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 1 case distinctions, treesize of input 40 treesize of output 45 [2018-12-09 15:30:36,610 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:36,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:36,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 53 [2018-12-09 15:30:36,616 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:37,912 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 46 treesize of output 41 [2018-12-09 15:30:37,912 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:38,501 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 56 treesize of output 49 [2018-12-09 15:30:38,501 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:39,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:39,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 59 [2018-12-09 15:30:39,428 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:39,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:39,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:39,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:30:39,436 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 1 case distinctions, treesize of input 46 treesize of output 51 [2018-12-09 15:30:39,436 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-12-09 15:30:39,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-09 15:30:39,660 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 15:30:40,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-12-09 15:30:41,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 15:30:41,579 INFO L202 ElimStorePlain]: Needed 62 recursive calls to eliminate 9 variables, input treesize:78, output treesize:199 [2018-12-09 15:30:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:30:41,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:30:41,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 35 [2018-12-09 15:30:41,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-09 15:30:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 15:30:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 15:30:41,750 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 36 states. [2018-12-09 15:30:42,244 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-09 15:30:44,826 WARN L180 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-12-09 15:30:50,160 WARN L180 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-12-09 15:30:58,359 WARN L180 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-12-09 15:31:02,682 WARN L180 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2018-12-09 15:31:08,357 WARN L180 SmtUtils]: Spent 5.61 s on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2018-12-09 15:31:10,707 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2018-12-09 15:31:13,361 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-12-09 15:31:14,029 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-09 15:31:29,174 WARN L180 SmtUtils]: Spent 12.55 s on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2018-12-09 15:31:33,861 WARN L180 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-12-09 15:31:40,166 WARN L180 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-12-09 15:31:43,055 WARN L180 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-12-09 15:31:45,321 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-12-09 15:31:49,646 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-12-09 15:31:50,106 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-09 15:31:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:50,452 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-09 15:31:50,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 15:31:50,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2018-12-09 15:31:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:50,454 INFO L225 Difference]: With dead ends: 77 [2018-12-09 15:31:50,454 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 15:31:50,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 70.3s TimeCoverageRelationStatistics Valid=447, Invalid=3213, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 15:31:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 15:31:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2018-12-09 15:31:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 15:31:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-09 15:31:50,457 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 34 [2018-12-09 15:31:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:50,457 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-09 15:31:50,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-09 15:31:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-09 15:31:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:31:50,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:50,458 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:50,458 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:31:50,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1760882810, now seen corresponding path program 2 times [2018-12-09 15:31:50,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:31:50,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:31:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:50,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:50,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:50,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:31:50,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:31:50,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:31:50,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:50,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:31:50,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 15:31:50,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:31:50,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,660 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 15:31:50,672 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 16 treesize of output 13 [2018-12-09 15:31:50,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 13 treesize of output 12 [2018-12-09 15:31:50,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-09 15:31:50,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 29 treesize of output 30 [2018-12-09 15:31:50,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 13 treesize of output 12 [2018-12-09 15:31:50,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:31:50,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-12-09 15:31:50,819 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 32 treesize of output 30 [2018-12-09 15:31:50,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 15:31:50,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 15:31:50,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-12-09 15:31:50,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:50,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:31:50,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:31:50,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-12-09 15:31:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:50,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:31:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-09 15:31:50,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 15:31:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 15:31:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-12-09 15:31:50,917 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 18 states. [2018-12-09 15:31:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:31:53,595 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-12-09 15:31:53,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 15:31:53,595 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-12-09 15:31:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:31:53,596 INFO L225 Difference]: With dead ends: 82 [2018-12-09 15:31:53,596 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 15:31:53,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-12-09 15:31:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 15:31:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 46. [2018-12-09 15:31:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 15:31:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-12-09 15:31:53,598 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 36 [2018-12-09 15:31:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:31:53,598 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-12-09 15:31:53,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 15:31:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-12-09 15:31:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:31:53,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:31:53,599 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:31:53,599 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:31:53,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash 24619024, now seen corresponding path program 1 times [2018-12-09 15:31:53,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:31:53,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:31:53,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:53,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:31:53,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:31:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:53,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:31:53,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:31:53,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:31:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:53,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:31:53,858 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:31:53,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 15:31:53,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,867 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 5 treesize of output 1 [2018-12-09 15:31:53,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,871 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 15:31:53,886 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 15 treesize of output 12 [2018-12-09 15:31:53,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 15:31:53,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 15:31:53,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 15:31:53,912 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 13 treesize of output 12 [2018-12-09 15:31:53,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:31:53,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:31:53,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 15:31:56,163 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 15:31:56,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-12-09 15:31:56,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-12-09 15:31:56,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:56,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2018-12-09 15:31:56,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 15:31:56,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 15:31:56,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:56,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-12-09 15:31:56,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:56,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-09 15:31:56,353 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:56,394 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-12-09 15:31:56,394 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-09 15:31:56,444 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 40 treesize of output 30 [2018-12-09 15:31:56,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 15:31:56,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-12-09 15:31:56,496 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-12-09 15:31:56,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-12-09 15:31:56,558 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 15:31:56,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 15:31:56,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 15:31:56,641 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:60, output treesize:86 [2018-12-09 15:31:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:31:56,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-12-09 15:31:56,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 15:31:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 15:31:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2018-12-09 15:31:56,770 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 32 states. [2018-12-09 15:32:00,832 WARN L180 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-12-09 15:32:02,994 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2018-12-09 15:32:03,184 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2018-12-09 15:32:08,223 WARN L180 SmtUtils]: Spent 5.00 s on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2018-12-09 15:32:10,504 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2018-12-09 15:32:10,823 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2018-12-09 15:32:13,087 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2018-12-09 15:32:18,538 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-12-09 15:32:19,769 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-12-09 15:32:23,777 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-12-09 15:32:27,939 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2018-12-09 15:32:31,475 WARN L180 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-09 15:32:35,621 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-12-09 15:32:39,206 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-12-09 15:32:39,729 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2018-12-09 15:32:44,618 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-09 15:32:51,940 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-09 15:32:57,055 WARN L180 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-09 15:32:59,152 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2018-12-09 15:32:59,323 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-09 15:33:02,722 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-12-09 15:33:04,108 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-09 15:33:13,796 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-09 15:33:14,169 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-12-09 15:33:14,457 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2018-12-09 15:33:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:33:14,606 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-09 15:33:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-09 15:33:14,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2018-12-09 15:33:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:33:14,606 INFO L225 Difference]: With dead ends: 110 [2018-12-09 15:33:14,606 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 15:33:14,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=1466, Invalid=6899, Unknown=7, NotChecked=0, Total=8372 [2018-12-09 15:33:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 15:33:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 15:33:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 15:33:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-09 15:33:14,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-12-09 15:33:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:33:14,608 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-09 15:33:14,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 15:33:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-09 15:33:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 15:33:14,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:33:14,609 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:33:14,609 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, substringErr7REQUIRES_VIOLATION, substringErr2REQUIRES_VIOLATION, substringErr8REQUIRES_VIOLATION, substringErr6REQUIRES_VIOLATION, substringErr1REQUIRES_VIOLATION, substringErr5REQUIRES_VIOLATION, substringErr0REQUIRES_VIOLATION, substringErr3REQUIRES_VIOLATION, substringErr9REQUIRES_VIOLATION, substringErr4REQUIRES_VIOLATION]=== [2018-12-09 15:33:14,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:33:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1307856916, now seen corresponding path program 3 times [2018-12-09 15:33:14,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:33:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:33:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:33:14,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:33:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:33:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 15:33:14,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:33:14,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:33:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:33:14,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 15:33:14,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:33:14,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:33:14,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:33:14,819 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 12 treesize of output 15 [2018-12-09 15:33:14,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 15:33:14,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:33:14,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:33:14,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:33 [2018-12-09 15:33:14,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-12-09 15:33:14,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 15:33:14,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,870 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 24 treesize of output 21 [2018-12-09 15:33:14,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 15:33:14,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 15:33:14,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2018-12-09 15:33:14,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2018-12-09 15:33:14,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-09 15:33:14,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 15:33:14,937 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 21 [2018-12-09 15:33:14,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:33:14,946 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-09 15:33:14,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-12-09 15:33:15,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-09 15:33:15,051 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 23 [2018-12-09 15:33:15,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:33:15,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-12-09 15:33:15,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 15:33:15,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-12-09 15:33:15,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-09 15:33:15,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 15:33:15,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 15:33:15,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:68 [2018-12-09 15:33:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 15:33:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:33:15,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-12-09 15:33:15,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 15:33:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 15:33:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-09 15:33:15,223 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2018-12-09 15:33:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:33:15,823 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-09 15:33:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 15:33:15,823 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2018-12-09 15:33:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:33:15,823 INFO L225 Difference]: With dead ends: 41 [2018-12-09 15:33:15,823 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:33:15,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 15:33:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:33:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:33:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:33:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:33:15,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-12-09 15:33:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:33:15,824 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:33:15,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 15:33:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:33:15,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:33:15,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:33:15 BoogieIcfgContainer [2018-12-09 15:33:15,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:33:15,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:33:15,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:33:15,827 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:33:15,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:29:49" (3/4) ... [2018-12-09 15:33:15,830 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:33:15,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 15:33:15,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-09 15:33:15,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-09 15:33:15,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 15:33:15,834 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure substring [2018-12-09 15:33:15,837 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-09 15:33:15,837 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 15:33:15,837 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 15:33:15,861 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f7b8b2a7-be12-4773-b75b-b7a508810aa7/bin-2019/uautomizer/witness.graphml [2018-12-09 15:33:15,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:33:15,861 INFO L168 Benchmark]: Toolchain (without parser) took 206479.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 951.7 MB in the beginning and 966.4 MB in the end (delta: -14.7 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:15,862 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:33:15,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:15,862 INFO L168 Benchmark]: Boogie Preprocessor took 27.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:15,862 INFO L168 Benchmark]: RCFGBuilder took 244.77 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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:15,862 INFO L168 Benchmark]: TraceAbstraction took 205911.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.0 GB in the beginning and 966.4 MB in the end (delta: 81.0 MB). Peak memory consumption was 129.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:15,862 INFO L168 Benchmark]: Witness Printer took 33.77 ms. Allocated memory is still 1.2 GB. Free memory was 966.4 MB in the beginning and 966.4 MB in the end (delta: 20.4 kB). Peak memory consumption was 20.4 kB. Max. memory is 11.5 GB. [2018-12-09 15:33:15,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.77 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: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 205911.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.0 GB in the beginning and 966.4 MB in the end (delta: 81.0 MB). Peak memory consumption was 129.8 MB. Max. memory is 11.5 GB. * Witness Printer took 33.77 ms. Allocated memory is still 1.2 GB. Free memory was 966.4 MB in the beginning and 966.4 MB in the end (delta: 20.4 kB). Peak memory consumption was 20.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 15 error locations. SAFE Result, 205.8s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 154.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 649 SDtfs, 2192 SDslu, 2614 SDs, 0 SdLazy, 4383 SolverSat, 395 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 686 GetRequests, 223 SyntacticMatches, 15 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3718 ImplicationChecksByTransitivity, 152.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 241 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 811 ConstructedInterpolants, 83 QuantifiedInterpolants, 300558 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1525 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 35/221 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...