./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i -s /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/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 ddbf4fb8c36ef19bcf4ca33c6e346a064158dbfa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 22:37:42,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:37:42,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:37:42,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:37:42,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:37:42,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:37:42,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:37:42,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:37:42,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:37:42,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:37:42,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:37:42,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:37:42,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:37:42,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:37:42,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:37:42,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:37:42,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:37:42,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:37:42,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:37:42,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:37:42,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:37:42,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:37:42,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:37:42,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:37:42,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:37:42,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:37:42,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:37:42,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:37:42,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:37:42,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:37:42,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:37:42,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:37:42,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:37:42,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:37:42,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:37:42,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:37:42,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:37:42,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:37:42,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:37:42,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:37:42,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:37:42,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-29 22:37:42,892 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:37:42,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:37:42,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:37:42,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:37:42,894 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 22:37:42,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:37:42,894 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:37:42,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-29 22:37:42,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:37:42,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:37:42,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:37:42,895 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-29 22:37:42,896 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-29 22:37:42,896 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-29 22:37:42,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 22:37:42,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-29 22:37:42,896 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:37:42,897 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:37:42,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:37:42,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 22:37:42,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 22:37:42,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 22:37:42,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 22:37:42,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:37:42,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 22:37:42,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 22:37:42,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 22:37:42,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 22:37:42,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/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 -> ddbf4fb8c36ef19bcf4ca33c6e346a064158dbfa [2020-11-29 22:37:43,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:37:43,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:37:43,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:37:43,229 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:37:43,229 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:37:43,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2020-11-29 22:37:43,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/data/8ed032aa0/204afc5dd91b48668eeeff51423dbd1f/FLAG7e028152a [2020-11-29 22:37:43,750 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:37:43,751 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2020-11-29 22:37:43,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/data/8ed032aa0/204afc5dd91b48668eeeff51423dbd1f/FLAG7e028152a [2020-11-29 22:37:44,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/data/8ed032aa0/204afc5dd91b48668eeeff51423dbd1f [2020-11-29 22:37:44,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:37:44,112 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-29 22:37:44,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:37:44,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:37:44,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:37:44,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e7d644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44, skipping insertion in model container [2020-11-29 22:37:44,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:37:44,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:37:44,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:37:44,501 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:37:44,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:37:44,651 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:37:44,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44 WrapperNode [2020-11-29 22:37:44,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:37:44,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:37:44,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:37:44,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:37:44,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... [2020-11-29 22:37:44,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:37:44,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:37:44,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:37:44,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:37:44,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/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 [2020-11-29 22:37:44,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-29 22:37:44,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:37:44,853 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-29 22:37:44,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-29 22:37:44,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-29 22:37:44,854 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-29 22:37:44,854 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-29 22:37:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-29 22:37:44,855 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-29 22:37:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-29 22:37:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-29 22:37:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-29 22:37:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:37:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-29 22:37:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-29 22:37:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-29 22:37:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-29 22:37:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-29 22:37:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-29 22:37:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-29 22:37:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-29 22:37:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-29 22:37:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-29 22:37:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-29 22:37:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-29 22:37:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-29 22:37:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-29 22:37:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-29 22:37:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-29 22:37:44,863 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-29 22:37:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-29 22:37:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-29 22:37:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-29 22:37:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-29 22:37:44,865 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-29 22:37:44,866 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-29 22:37:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-29 22:37:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-29 22:37:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-29 22:37:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-29 22:37:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-29 22:37:44,867 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-29 22:37:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-29 22:37:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-29 22:37:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-29 22:37:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-29 22:37:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-29 22:37:44,868 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-29 22:37:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-29 22:37:44,869 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-29 22:37:44,870 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-29 22:37:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-29 22:37:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-29 22:37:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-29 22:37:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-29 22:37:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-29 22:37:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-29 22:37:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-29 22:37:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-29 22:37:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-29 22:37:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-29 22:37:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-29 22:37:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-29 22:37:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-29 22:37:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-29 22:37:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-29 22:37:44,875 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-29 22:37:44,876 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-29 22:37:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-29 22:37:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-29 22:37:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-29 22:37:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-29 22:37:44,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-29 22:37:44,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:37:44,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:37:45,246 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-29 22:37:45,706 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:37:45,706 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-29 22:37:45,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:37:45 BoogieIcfgContainer [2020-11-29 22:37:45,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:37:45,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 22:37:45,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 22:37:45,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 22:37:45,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:37:44" (1/3) ... [2020-11-29 22:37:45,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef5406c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:37:45, skipping insertion in model container [2020-11-29 22:37:45,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:37:44" (2/3) ... [2020-11-29 22:37:45,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef5406c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:37:45, skipping insertion in model container [2020-11-29 22:37:45,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:37:45" (3/3) ... [2020-11-29 22:37:45,717 INFO L111 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2020-11-29 22:37:45,733 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 22:37:45,744 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2020-11-29 22:37:45,755 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2020-11-29 22:37:45,786 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 22:37:45,791 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-29 22:37:45,791 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 22:37:45,791 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 22:37:45,791 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 22:37:45,791 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 22:37:45,791 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 22:37:45,791 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 22:37:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2020-11-29 22:37:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-29 22:37:45,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:45,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:45,833 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash -630218653, now seen corresponding path program 1 times [2020-11-29 22:37:45,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:45,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129127279] [2020-11-29 22:37:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:46,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:46,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129127279] [2020-11-29 22:37:46,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:46,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:37:46,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070506721] [2020-11-29 22:37:46,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 22:37:46,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:37:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:37:46,140 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2020-11-29 22:37:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:46,520 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2020-11-29 22:37:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:37:46,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-29 22:37:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:46,539 INFO L225 Difference]: With dead ends: 130 [2020-11-29 22:37:46,543 INFO L226 Difference]: Without dead ends: 122 [2020-11-29 22:37:46,545 INFO L677 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 [2020-11-29 22:37:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-29 22:37:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2020-11-29 22:37:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-29 22:37:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2020-11-29 22:37:46,602 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 8 [2020-11-29 22:37:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:46,603 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2020-11-29 22:37:46,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 22:37:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2020-11-29 22:37:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-29 22:37:46,604 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:46,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:46,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 22:37:46,605 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -630218652, now seen corresponding path program 1 times [2020-11-29 22:37:46,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:46,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151241002] [2020-11-29 22:37:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:46,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:46,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151241002] [2020-11-29 22:37:46,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:46,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:37:46,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42304473] [2020-11-29 22:37:46,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 22:37:46,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:37:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:37:46,751 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 4 states. [2020-11-29 22:37:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:47,020 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2020-11-29 22:37:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:37:47,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-29 22:37:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:47,022 INFO L225 Difference]: With dead ends: 101 [2020-11-29 22:37:47,022 INFO L226 Difference]: Without dead ends: 101 [2020-11-29 22:37:47,023 INFO L677 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 [2020-11-29 22:37:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-29 22:37:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-29 22:37:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-29 22:37:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2020-11-29 22:37:47,038 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 8 [2020-11-29 22:37:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:47,039 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2020-11-29 22:37:47,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 22:37:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-11-29 22:37:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 22:37:47,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:47,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:47,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 22:37:47,040 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 54000519, now seen corresponding path program 1 times [2020-11-29 22:37:47,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:47,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639866594] [2020-11-29 22:37:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:47,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:47,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639866594] [2020-11-29 22:37:47,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:47,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 22:37:47,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013406997] [2020-11-29 22:37:47,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:37:47,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:37:47,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:37:47,160 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2020-11-29 22:37:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:47,481 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2020-11-29 22:37:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:37:47,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-29 22:37:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:47,482 INFO L225 Difference]: With dead ends: 111 [2020-11-29 22:37:47,482 INFO L226 Difference]: Without dead ends: 111 [2020-11-29 22:37:47,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:37:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-29 22:37:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2020-11-29 22:37:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-29 22:37:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2020-11-29 22:37:47,491 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 13 [2020-11-29 22:37:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:47,491 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2020-11-29 22:37:47,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:37:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2020-11-29 22:37:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 22:37:47,492 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:47,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:47,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 22:37:47,493 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash 54000520, now seen corresponding path program 1 times [2020-11-29 22:37:47,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:47,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557015374] [2020-11-29 22:37:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:47,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:47,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557015374] [2020-11-29 22:37:47,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:47,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 22:37:47,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99139554] [2020-11-29 22:37:47,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:37:47,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:37:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:37:47,603 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 5 states. [2020-11-29 22:37:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:47,971 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2020-11-29 22:37:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:37:47,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-29 22:37:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:47,974 INFO L225 Difference]: With dead ends: 128 [2020-11-29 22:37:47,975 INFO L226 Difference]: Without dead ends: 128 [2020-11-29 22:37:47,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:37:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-29 22:37:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2020-11-29 22:37:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-29 22:37:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2020-11-29 22:37:47,987 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 13 [2020-11-29 22:37:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:47,987 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2020-11-29 22:37:47,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:37:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2020-11-29 22:37:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 22:37:47,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:47,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:47,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 22:37:47,989 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:47,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash -274507978, now seen corresponding path program 1 times [2020-11-29 22:37:47,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:47,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205182173] [2020-11-29 22:37:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:48,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:48,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205182173] [2020-11-29 22:37:48,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:48,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 22:37:48,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968682122] [2020-11-29 22:37:48,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:37:48,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:37:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:37:48,108 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 7 states. [2020-11-29 22:37:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:48,396 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2020-11-29 22:37:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:37:48,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-29 22:37:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:48,399 INFO L225 Difference]: With dead ends: 161 [2020-11-29 22:37:48,399 INFO L226 Difference]: Without dead ends: 161 [2020-11-29 22:37:48,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:37:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-29 22:37:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 119. [2020-11-29 22:37:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-29 22:37:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2020-11-29 22:37:48,409 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 21 [2020-11-29 22:37:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:48,409 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2020-11-29 22:37:48,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:37:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2020-11-29 22:37:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 22:37:48,410 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:48,410 INFO L422 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] [2020-11-29 22:37:48,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 22:37:48,411 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1665010395, now seen corresponding path program 1 times [2020-11-29 22:37:48,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:48,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801080821] [2020-11-29 22:37:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:48,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:48,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801080821] [2020-11-29 22:37:48,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:48,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 22:37:48,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843457818] [2020-11-29 22:37:48,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:37:48,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:37:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:37:48,537 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 7 states. [2020-11-29 22:37:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:48,964 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2020-11-29 22:37:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:37:48,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-29 22:37:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:48,978 INFO L225 Difference]: With dead ends: 174 [2020-11-29 22:37:48,978 INFO L226 Difference]: Without dead ends: 174 [2020-11-29 22:37:48,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:37:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-29 22:37:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 119. [2020-11-29 22:37:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-29 22:37:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2020-11-29 22:37:48,989 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 23 [2020-11-29 22:37:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:48,990 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2020-11-29 22:37:48,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:37:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2020-11-29 22:37:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 22:37:48,991 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:48,991 INFO L422 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] [2020-11-29 22:37:48,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 22:37:48,991 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1805740582, now seen corresponding path program 1 times [2020-11-29 22:37:48,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:48,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678485551] [2020-11-29 22:37:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:49,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:49,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678485551] [2020-11-29 22:37:49,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:49,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 22:37:49,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471707711] [2020-11-29 22:37:49,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:37:49,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:37:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:37:49,150 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 5 states. [2020-11-29 22:37:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:49,393 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2020-11-29 22:37:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:37:49,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-29 22:37:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:49,394 INFO L225 Difference]: With dead ends: 127 [2020-11-29 22:37:49,395 INFO L226 Difference]: Without dead ends: 127 [2020-11-29 22:37:49,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:37:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-29 22:37:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2020-11-29 22:37:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-29 22:37:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2020-11-29 22:37:49,401 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 23 [2020-11-29 22:37:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:49,402 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2020-11-29 22:37:49,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:37:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2020-11-29 22:37:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 22:37:49,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:49,403 INFO L422 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, 1] [2020-11-29 22:37:49,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 22:37:49,403 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash -352110139, now seen corresponding path program 1 times [2020-11-29 22:37:49,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:49,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599608109] [2020-11-29 22:37:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:49,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:49,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599608109] [2020-11-29 22:37:49,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:49,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 22:37:49,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893442813] [2020-11-29 22:37:49,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:37:49,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:37:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:37:49,565 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 6 states. [2020-11-29 22:37:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:49,854 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2020-11-29 22:37:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:37:49,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-29 22:37:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:49,856 INFO L225 Difference]: With dead ends: 157 [2020-11-29 22:37:49,856 INFO L226 Difference]: Without dead ends: 147 [2020-11-29 22:37:49,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:37:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-29 22:37:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2020-11-29 22:37:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-29 22:37:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2020-11-29 22:37:49,861 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 26 [2020-11-29 22:37:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:49,861 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2020-11-29 22:37:49,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:37:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2020-11-29 22:37:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 22:37:49,862 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:49,862 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:49,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 22:37:49,862 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1859785743, now seen corresponding path program 1 times [2020-11-29 22:37:49,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:49,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216336558] [2020-11-29 22:37:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:49,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:49,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216336558] [2020-11-29 22:37:49,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:49,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:37:49,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797458590] [2020-11-29 22:37:49,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:37:49,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:37:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:37:49,941 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 7 states. [2020-11-29 22:37:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:50,348 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2020-11-29 22:37:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:37:50,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-11-29 22:37:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:50,350 INFO L225 Difference]: With dead ends: 126 [2020-11-29 22:37:50,350 INFO L226 Difference]: Without dead ends: 126 [2020-11-29 22:37:50,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-29 22:37:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-29 22:37:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2020-11-29 22:37:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-11-29 22:37:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2020-11-29 22:37:50,359 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 26 [2020-11-29 22:37:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:50,362 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2020-11-29 22:37:50,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:37:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2020-11-29 22:37:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 22:37:50,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:50,363 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:50,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 22:37:50,363 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1859785742, now seen corresponding path program 1 times [2020-11-29 22:37:50,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:50,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774671496] [2020-11-29 22:37:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:50,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:50,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774671496] [2020-11-29 22:37:50,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:50,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:37:50,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430097119] [2020-11-29 22:37:50,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:37:50,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:37:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:37:50,538 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 7 states. [2020-11-29 22:37:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:50,996 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2020-11-29 22:37:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-29 22:37:50,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-11-29 22:37:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:50,997 INFO L225 Difference]: With dead ends: 123 [2020-11-29 22:37:50,998 INFO L226 Difference]: Without dead ends: 123 [2020-11-29 22:37:50,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-29 22:37:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-29 22:37:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2020-11-29 22:37:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-29 22:37:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2020-11-29 22:37:51,003 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 26 [2020-11-29 22:37:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:51,003 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2020-11-29 22:37:51,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:37:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2020-11-29 22:37:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 22:37:51,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:51,004 INFO L422 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, 1, 1, 1, 1] [2020-11-29 22:37:51,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 22:37:51,004 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 741801757, now seen corresponding path program 1 times [2020-11-29 22:37:51,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:51,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383303544] [2020-11-29 22:37:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:51,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:51,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383303544] [2020-11-29 22:37:51,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:51,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 22:37:51,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375151782] [2020-11-29 22:37:51,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 22:37:51,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:37:51,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:37:51,300 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states. [2020-11-29 22:37:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:51,701 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2020-11-29 22:37:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:37:51,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-29 22:37:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:51,703 INFO L225 Difference]: With dead ends: 115 [2020-11-29 22:37:51,703 INFO L226 Difference]: Without dead ends: 104 [2020-11-29 22:37:51,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:37:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-29 22:37:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2020-11-29 22:37:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 22:37:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2020-11-29 22:37:51,707 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 29 [2020-11-29 22:37:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:51,707 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2020-11-29 22:37:51,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 22:37:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2020-11-29 22:37:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 22:37:51,708 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:51,708 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:51,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 22:37:51,709 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash -856212064, now seen corresponding path program 1 times [2020-11-29 22:37:51,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:51,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310254164] [2020-11-29 22:37:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:51,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 22:37:51,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310254164] [2020-11-29 22:37:51,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:37:51,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 22:37:51,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968562327] [2020-11-29 22:37:51,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:37:51,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:37:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:37:51,864 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 8 states. [2020-11-29 22:37:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:52,083 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2020-11-29 22:37:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 22:37:52,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-11-29 22:37:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:52,085 INFO L225 Difference]: With dead ends: 145 [2020-11-29 22:37:52,085 INFO L226 Difference]: Without dead ends: 145 [2020-11-29 22:37:52,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:37:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-29 22:37:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2020-11-29 22:37:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-29 22:37:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2020-11-29 22:37:52,089 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 34 [2020-11-29 22:37:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:52,089 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2020-11-29 22:37:52,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:37:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2020-11-29 22:37:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 22:37:52,090 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:52,090 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:52,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 22:37:52,091 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash -155147486, now seen corresponding path program 1 times [2020-11-29 22:37:52,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:52,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371679307] [2020-11-29 22:37:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:52,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:52,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371679307] [2020-11-29 22:37:52,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96224868] [2020-11-29 22:37:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:37:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:52,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 22:37:52,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:37:52,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:37:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:52,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:37:52,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-11-29 22:37:52,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901261913] [2020-11-29 22:37:52,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:37:52,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:37:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:37:52,527 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 7 states. [2020-11-29 22:37:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:52,808 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2020-11-29 22:37:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:37:52,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-11-29 22:37:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:52,810 INFO L225 Difference]: With dead ends: 165 [2020-11-29 22:37:52,810 INFO L226 Difference]: Without dead ends: 165 [2020-11-29 22:37:52,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:37:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-29 22:37:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2020-11-29 22:37:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-29 22:37:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2020-11-29 22:37:52,815 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 34 [2020-11-29 22:37:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:52,815 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2020-11-29 22:37:52,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:37:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2020-11-29 22:37:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:37:52,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:52,824 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:53,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-29 22:37:53,025 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1958078735, now seen corresponding path program 1 times [2020-11-29 22:37:53,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:53,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747562082] [2020-11-29 22:37:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:53,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:53,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747562082] [2020-11-29 22:37:53,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602223324] [2020-11-29 22:37:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:37:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:53,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-29 22:37:53,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:37:53,589 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:37:53,590 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:53,595 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:37:53,658 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:37:53,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:53,681 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,681 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2020-11-29 22:37:53,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:53,808 INFO L384 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 22 treesize of output 21 [2020-11-29 22:37:53,809 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:53,834 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,834 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2020-11-29 22:37:53,892 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:53,892 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:37:53,893 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:53,906 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2020-11-29 22:37:53,955 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_20|], 6=[|v_#memory_int_24|]} [2020-11-29 22:37:53,973 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:37:53,973 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:53,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:53,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:53,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:53,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:54,002 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2020-11-29 22:37:54,003 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:54,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:54,039 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:54,040 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:40 [2020-11-29 22:37:54,114 INFO L384 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 8 [2020-11-29 22:37:54,114 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:54,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:54,127 INFO L545 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. [2020-11-29 22:37:54,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:31 [2020-11-29 22:37:54,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:54,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2020-11-29 22:37:54,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:54,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:54,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:37:54,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:38 [2020-11-29 22:37:54,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:54,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:54,503 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:37:54,504 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2020-11-29 22:37:54,506 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:54,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:54,522 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:54,522 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:4 [2020-11-29 22:37:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:54,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:37:54,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2020-11-29 22:37:54,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005378953] [2020-11-29 22:37:54,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-29 22:37:54,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:54,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-29 22:37:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2020-11-29 22:37:54,532 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 26 states. [2020-11-29 22:37:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:56,149 INFO L93 Difference]: Finished difference Result 297 states and 336 transitions. [2020-11-29 22:37:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-29 22:37:56,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2020-11-29 22:37:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:56,157 INFO L225 Difference]: With dead ends: 297 [2020-11-29 22:37:56,157 INFO L226 Difference]: Without dead ends: 297 [2020-11-29 22:37:56,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=1253, Unknown=0, NotChecked=0, Total=1560 [2020-11-29 22:37:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-11-29 22:37:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 148. [2020-11-29 22:37:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-29 22:37:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2020-11-29 22:37:56,164 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 36 [2020-11-29 22:37:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:56,164 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2020-11-29 22:37:56,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-29 22:37:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2020-11-29 22:37:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:37:56,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:56,173 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:56,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-29 22:37:56,389 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:56,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1662254105, now seen corresponding path program 1 times [2020-11-29 22:37:56,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:56,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618992774] [2020-11-29 22:37:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:56,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:56,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618992774] [2020-11-29 22:37:56,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840620553] [2020-11-29 22:37:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:37:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:56,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjunts are in the unsatisfiable core [2020-11-29 22:37:56,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:37:56,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:37:56,821 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:56,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:56,826 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:56,827 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:37:56,883 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-29 22:37:56,883 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:56,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:56,897 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:56,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-11-29 22:37:56,948 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:56,948 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:37:56,949 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:56,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:56,964 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:56,965 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2020-11-29 22:37:57,008 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_27|]} [2020-11-29 22:37:57,014 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:37:57,014 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:57,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:57,045 INFO L384 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 27 treesize of output 11 [2020-11-29 22:37:57,045 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:57,064 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,064 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2020-11-29 22:37:57,109 INFO L384 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 8 [2020-11-29 22:37:57,109 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:57,120 INFO L545 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. [2020-11-29 22:37:57,120 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-11-29 22:37:57,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-29 22:37:57,221 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:57,238 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:37:57,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2020-11-29 22:37:57,410 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:37:57,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-29 22:37:57,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:57,431 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:57,431 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2020-11-29 22:37:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:57,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:37:57,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2020-11-29 22:37:57,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809303711] [2020-11-29 22:37:57,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-29 22:37:57,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-29 22:37:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:37:57,445 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand 22 states. [2020-11-29 22:37:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:37:58,727 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2020-11-29 22:37:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-29 22:37:58,728 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2020-11-29 22:37:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:37:58,729 INFO L225 Difference]: With dead ends: 238 [2020-11-29 22:37:58,729 INFO L226 Difference]: Without dead ends: 238 [2020-11-29 22:37:58,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 22:37:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-11-29 22:37:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2020-11-29 22:37:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-29 22:37:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2020-11-29 22:37:58,736 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 36 [2020-11-29 22:37:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:37:58,736 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2020-11-29 22:37:58,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-29 22:37:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2020-11-29 22:37:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:37:58,738 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:37:58,738 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:37:58,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-29 22:37:58,953 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:37:58,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:37:58,953 INFO L82 PathProgramCache]: Analyzing trace with hash 970712175, now seen corresponding path program 1 times [2020-11-29 22:37:58,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:37:58,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224809162] [2020-11-29 22:37:58,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:37:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:59,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:37:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:59,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224809162] [2020-11-29 22:37:59,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045577581] [2020-11-29 22:37:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:37:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:37:59,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2020-11-29 22:37:59,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:37:59,354 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:37:59,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,358 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,358 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:37:59,416 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-29 22:37:59,416 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-11-29 22:37:59,479 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,479 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:37:59,479 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,492 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,493 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2020-11-29 22:37:59,526 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_22|], 2=[|v_#memory_int_30|]} [2020-11-29 22:37:59,531 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:37:59,531 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:37:59,556 INFO L384 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 27 treesize of output 11 [2020-11-29 22:37:59,556 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,572 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2020-11-29 22:37:59,632 INFO L384 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 8 [2020-11-29 22:37:59,633 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,646 INFO L545 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. [2020-11-29 22:37:59,646 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-11-29 22:37:59,742 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-29 22:37:59,742 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,755 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,757 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:37:59,758 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2020-11-29 22:37:59,883 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:37:59,884 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-29 22:37:59,886 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:37:59,897 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:37:59,897 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2020-11-29 22:37:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:37:59,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:37:59,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2020-11-29 22:37:59,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283399104] [2020-11-29 22:37:59,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-29 22:37:59,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:37:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-29 22:37:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:37:59,911 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand 22 states. [2020-11-29 22:38:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:01,253 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2020-11-29 22:38:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-29 22:38:01,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2020-11-29 22:38:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:01,255 INFO L225 Difference]: With dead ends: 272 [2020-11-29 22:38:01,256 INFO L226 Difference]: Without dead ends: 272 [2020-11-29 22:38:01,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 22:38:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-29 22:38:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 165. [2020-11-29 22:38:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-11-29 22:38:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2020-11-29 22:38:01,262 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 36 [2020-11-29 22:38:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:01,262 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2020-11-29 22:38:01,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-29 22:38:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2020-11-29 22:38:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:38:01,263 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:01,263 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:01,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:01,477 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 674887545, now seen corresponding path program 1 times [2020-11-29 22:38:01,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:01,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381742249] [2020-11-29 22:38:01,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:01,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:01,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381742249] [2020-11-29 22:38:01,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561020344] [2020-11-29 22:38:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:01,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2020-11-29 22:38:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:01,863 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:38:01,863 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:01,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:01,868 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:01,868 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:38:01,904 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:38:01,904 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:01,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:01,918 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:01,919 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2020-11-29 22:38:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:01,971 INFO L384 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 21 treesize of output 20 [2020-11-29 22:38:01,971 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:01,984 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:01,984 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:01,984 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2020-11-29 22:38:02,031 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,031 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:02,032 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,046 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2020-11-29 22:38:02,101 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 6=[|v_#memory_int_34|]} [2020-11-29 22:38:02,106 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:02,106 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:02,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:02,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:02,140 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 22:38:02,141 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,153 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,153 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:39 [2020-11-29 22:38:02,186 INFO L384 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 8 [2020-11-29 22:38:02,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2020-11-29 22:38:02,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:02,268 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2020-11-29 22:38:02,269 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,279 INFO L545 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. [2020-11-29 22:38:02,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2020-11-29 22:38:02,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:02,408 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-11-29 22:38:02,410 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:02,423 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:02,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2020-11-29 22:38:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:02,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:02,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2020-11-29 22:38:02,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690801204] [2020-11-29 22:38:02,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-29 22:38:02,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-29 22:38:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2020-11-29 22:38:02,434 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand 26 states. [2020-11-29 22:38:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:03,668 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2020-11-29 22:38:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 22:38:03,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2020-11-29 22:38:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:03,670 INFO L225 Difference]: With dead ends: 254 [2020-11-29 22:38:03,670 INFO L226 Difference]: Without dead ends: 254 [2020-11-29 22:38:03,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2020-11-29 22:38:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-11-29 22:38:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 165. [2020-11-29 22:38:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-11-29 22:38:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 191 transitions. [2020-11-29 22:38:03,676 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 191 transitions. Word has length 36 [2020-11-29 22:38:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:03,678 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 191 transitions. [2020-11-29 22:38:03,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-29 22:38:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 191 transitions. [2020-11-29 22:38:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:38:03,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:03,679 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:03,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-29 22:38:03,893 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1662237824, now seen corresponding path program 1 times [2020-11-29 22:38:03,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:03,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704276084] [2020-11-29 22:38:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:04,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:04,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704276084] [2020-11-29 22:38:04,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153188966] [2020-11-29 22:38:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:04,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-29 22:38:04,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:04,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:38:04,359 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,364 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:04,364 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:38:04,416 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:04,416 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:04,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:04,424 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,424 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-29 22:38:04,452 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:04,452 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:04,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2020-11-29 22:38:04,580 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:04,580 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2020-11-29 22:38:04,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:38:04,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:38:04,583 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,597 INFO L625 ElimStorePlain]: treesize reduction 36, result has 41.0 percent of original size [2020-11-29 22:38:04,597 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,597 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2020-11-29 22:38:04,645 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 22:38:04,645 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:04,651 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:04,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2020-11-29 22:38:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:04,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:04,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2020-11-29 22:38:04,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107333479] [2020-11-29 22:38:04,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-29 22:38:04,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-29 22:38:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2020-11-29 22:38:04,659 INFO L87 Difference]: Start difference. First operand 165 states and 191 transitions. Second operand 22 states. [2020-11-29 22:38:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:05,711 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2020-11-29 22:38:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 22:38:05,712 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2020-11-29 22:38:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:05,713 INFO L225 Difference]: With dead ends: 256 [2020-11-29 22:38:05,713 INFO L226 Difference]: Without dead ends: 256 [2020-11-29 22:38:05,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2020-11-29 22:38:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-29 22:38:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2020-11-29 22:38:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 22:38:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2020-11-29 22:38:05,719 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 36 [2020-11-29 22:38:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:05,719 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2020-11-29 22:38:05,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-29 22:38:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2020-11-29 22:38:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 22:38:05,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:05,720 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:05,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-11-29 22:38:05,920 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1662237825, now seen corresponding path program 1 times [2020-11-29 22:38:05,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:05,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334423448] [2020-11-29 22:38:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:06,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:06,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334423448] [2020-11-29 22:38:06,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028624037] [2020-11-29 22:38:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:06,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-29 22:38:06,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:06,363 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:38:06,363 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,375 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,375 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:38:06,414 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_69|]} [2020-11-29 22:38:06,417 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:38:06,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,445 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,445 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:06,445 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,455 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,455 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2020-11-29 22:38:06,463 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:06,463 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,488 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:06,489 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,503 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,504 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,504 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2020-11-29 22:38:06,556 INFO L384 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 35 treesize of output 11 [2020-11-29 22:38:06,556 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,585 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,585 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2020-11-29 22:38:06,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:38:06,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:38:06,588 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,612 INFO L625 ElimStorePlain]: treesize reduction 28, result has 50.0 percent of original size [2020-11-29 22:38:06,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,612 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:28 [2020-11-29 22:38:06,663 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-11-29 22:38:06,663 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,673 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-29 22:38:06,674 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:06,680 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:06,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2020-11-29 22:38:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:06,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:06,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2020-11-29 22:38:06,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025549613] [2020-11-29 22:38:06,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-29 22:38:06,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-29 22:38:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-11-29 22:38:06,692 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand 20 states. [2020-11-29 22:38:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:07,526 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2020-11-29 22:38:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 22:38:07,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2020-11-29 22:38:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:07,528 INFO L225 Difference]: With dead ends: 267 [2020-11-29 22:38:07,528 INFO L226 Difference]: Without dead ends: 267 [2020-11-29 22:38:07,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2020-11-29 22:38:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-11-29 22:38:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 167. [2020-11-29 22:38:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-29 22:38:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2020-11-29 22:38:07,534 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 36 [2020-11-29 22:38:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:07,535 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2020-11-29 22:38:07,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-29 22:38:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2020-11-29 22:38:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 22:38:07,535 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:07,535 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:07,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:07,753 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1726954085, now seen corresponding path program 1 times [2020-11-29 22:38:07,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:07,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724343880] [2020-11-29 22:38:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:07,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:07,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724343880] [2020-11-29 22:38:07,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623717284] [2020-11-29 22:38:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-29 22:38:08,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:08,127 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,127 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:08,127 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:08,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,135 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:08,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2020-11-29 22:38:08,167 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:08,167 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:08,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,180 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:08,181 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2020-11-29 22:38:08,312 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,313 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 66 [2020-11-29 22:38:08,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:38:08,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:38:08,314 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:08,334 INFO L625 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2020-11-29 22:38:08,335 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:08,335 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:27 [2020-11-29 22:38:08,431 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-11-29 22:38:08,431 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:08,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,445 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,446 INFO L384 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 30 treesize of output 24 [2020-11-29 22:38:08,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:08,450 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-29 22:38:08,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:08,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:08,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-29 22:38:08,462 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2020-11-29 22:38:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:08,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:08,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-11-29 22:38:08,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285675976] [2020-11-29 22:38:08,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-29 22:38:08,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-29 22:38:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2020-11-29 22:38:08,510 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand 25 states. [2020-11-29 22:38:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:10,856 INFO L93 Difference]: Finished difference Result 366 states and 416 transitions. [2020-11-29 22:38:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-29 22:38:10,857 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2020-11-29 22:38:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:10,859 INFO L225 Difference]: With dead ends: 366 [2020-11-29 22:38:10,859 INFO L226 Difference]: Without dead ends: 364 [2020-11-29 22:38:10,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=610, Invalid=2930, Unknown=0, NotChecked=0, Total=3540 [2020-11-29 22:38:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-29 22:38:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 194. [2020-11-29 22:38:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-11-29 22:38:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2020-11-29 22:38:10,867 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 39 [2020-11-29 22:38:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:10,868 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2020-11-29 22:38:10,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-29 22:38:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2020-11-29 22:38:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 22:38:10,869 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:10,869 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:11,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:11,083 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2049556502, now seen corresponding path program 1 times [2020-11-29 22:38:11,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:11,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804365415] [2020-11-29 22:38:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:11,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 22:38:11,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804365415] [2020-11-29 22:38:11,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448704011] [2020-11-29 22:38:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:11,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 22:38:11,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:11,422 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-29 22:38:11,422 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:11,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:11,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:11,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2020-11-29 22:38:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:11,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:11,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-11-29 22:38:11,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163664649] [2020-11-29 22:38:11,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-29 22:38:11,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-29 22:38:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-11-29 22:38:11,447 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand 15 states. [2020-11-29 22:38:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:11,812 INFO L93 Difference]: Finished difference Result 427 states and 519 transitions. [2020-11-29 22:38:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-29 22:38:11,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-11-29 22:38:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:11,814 INFO L225 Difference]: With dead ends: 427 [2020-11-29 22:38:11,814 INFO L226 Difference]: Without dead ends: 427 [2020-11-29 22:38:11,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2020-11-29 22:38:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-29 22:38:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 260. [2020-11-29 22:38:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-11-29 22:38:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 339 transitions. [2020-11-29 22:38:11,822 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 339 transitions. Word has length 42 [2020-11-29 22:38:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:11,822 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 339 transitions. [2020-11-29 22:38:11,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-29 22:38:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 339 transitions. [2020-11-29 22:38:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-29 22:38:11,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:11,823 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:12,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:12,024 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:12,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:12,024 INFO L82 PathProgramCache]: Analyzing trace with hash -728854417, now seen corresponding path program 1 times [2020-11-29 22:38:12,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:12,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748909112] [2020-11-29 22:38:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:12,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-29 22:38:12,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748909112] [2020-11-29 22:38:12,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:38:12,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:38:12,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672470804] [2020-11-29 22:38:12,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:38:12,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:38:12,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:38:12,110 INFO L87 Difference]: Start difference. First operand 260 states and 339 transitions. Second operand 6 states. [2020-11-29 22:38:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:12,318 INFO L93 Difference]: Finished difference Result 259 states and 337 transitions. [2020-11-29 22:38:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:38:12,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-11-29 22:38:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:12,322 INFO L225 Difference]: With dead ends: 259 [2020-11-29 22:38:12,322 INFO L226 Difference]: Without dead ends: 259 [2020-11-29 22:38:12,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:38:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-11-29 22:38:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2020-11-29 22:38:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-11-29 22:38:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 336 transitions. [2020-11-29 22:38:12,331 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 336 transitions. Word has length 41 [2020-11-29 22:38:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:12,331 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 336 transitions. [2020-11-29 22:38:12,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:38:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 336 transitions. [2020-11-29 22:38:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 22:38:12,332 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:12,332 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:12,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 22:38:12,333 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 242142951, now seen corresponding path program 1 times [2020-11-29 22:38:12,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:12,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125062029] [2020-11-29 22:38:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:12,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-29 22:38:12,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125062029] [2020-11-29 22:38:12,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135392595] [2020-11-29 22:38:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:12,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-29 22:38:12,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:12,681 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:12,682 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:12,682 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:12,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:12,687 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:12,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-11-29 22:38:12,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:12,710 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:12,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:12,717 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:12,717 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2020-11-29 22:38:12,852 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:12,853 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2020-11-29 22:38:12,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:38:12,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:38:12,854 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:12,872 INFO L625 ElimStorePlain]: treesize reduction 36, result has 43.8 percent of original size [2020-11-29 22:38:12,873 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:12,873 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:28 [2020-11-29 22:38:13,035 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:13,036 INFO L384 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 31 treesize of output 25 [2020-11-29 22:38:13,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:13,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:13,038 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:13,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:13,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:13,051 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:13,051 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2020-11-29 22:38:13,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:13,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:13,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2020-11-29 22:38:13,249 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:13,257 INFO L625 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-11-29 22:38:13,257 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:13,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2020-11-29 22:38:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:13,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:13,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2020-11-29 22:38:13,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937736230] [2020-11-29 22:38:13,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-29 22:38:13,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-29 22:38:13,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2020-11-29 22:38:13,295 INFO L87 Difference]: Start difference. First operand 258 states and 336 transitions. Second operand 28 states. [2020-11-29 22:38:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:16,417 INFO L93 Difference]: Finished difference Result 420 states and 515 transitions. [2020-11-29 22:38:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-29 22:38:16,418 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2020-11-29 22:38:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:16,420 INFO L225 Difference]: With dead ends: 420 [2020-11-29 22:38:16,420 INFO L226 Difference]: Without dead ends: 420 [2020-11-29 22:38:16,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=599, Invalid=3183, Unknown=0, NotChecked=0, Total=3782 [2020-11-29 22:38:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-11-29 22:38:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 266. [2020-11-29 22:38:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2020-11-29 22:38:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 344 transitions. [2020-11-29 22:38:16,429 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 344 transitions. Word has length 42 [2020-11-29 22:38:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:16,429 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 344 transitions. [2020-11-29 22:38:16,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-29 22:38:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 344 transitions. [2020-11-29 22:38:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-29 22:38:16,430 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:16,430 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:16,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:16,632 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:16,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1910341849, now seen corresponding path program 1 times [2020-11-29 22:38:16,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:16,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823679540] [2020-11-29 22:38:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:16,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:16,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823679540] [2020-11-29 22:38:16,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25963232] [2020-11-29 22:38:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:17,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-29 22:38:17,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:17,101 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:38:17,101 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,104 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:38:17,151 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,152 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:17,152 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,159 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,159 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-11-29 22:38:17,188 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:17,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,202 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:38:17,202 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,214 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2020-11-29 22:38:17,298 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_23|]} [2020-11-29 22:38:17,304 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2020-11-29 22:38:17,304 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,361 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,361 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2020-11-29 22:38:17,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 22:38:17,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:38:17,363 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,397 INFO L625 ElimStorePlain]: treesize reduction 36, result has 69.2 percent of original size [2020-11-29 22:38:17,402 INFO L384 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 52 treesize of output 16 [2020-11-29 22:38:17,402 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:17,415 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:124, output treesize:48 [2020-11-29 22:38:17,613 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:38:17,614 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2020-11-29 22:38:17,615 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,635 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:38:17,635 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-11-29 22:38:17,636 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,654 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:17,654 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:72, output treesize:17 [2020-11-29 22:38:17,730 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:38:17,731 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,731 INFO L384 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 15 treesize of output 10 [2020-11-29 22:38:17,731 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:17,741 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:17,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2020-11-29 22:38:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:17,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:17,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2020-11-29 22:38:17,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821715676] [2020-11-29 22:38:17,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-29 22:38:17,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:17,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-29 22:38:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2020-11-29 22:38:17,750 INFO L87 Difference]: Start difference. First operand 266 states and 344 transitions. Second operand 26 states. [2020-11-29 22:38:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:38:19,075 INFO L93 Difference]: Finished difference Result 258 states and 306 transitions. [2020-11-29 22:38:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-29 22:38:19,076 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2020-11-29 22:38:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:38:19,077 INFO L225 Difference]: With dead ends: 258 [2020-11-29 22:38:19,077 INFO L226 Difference]: Without dead ends: 258 [2020-11-29 22:38:19,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2020-11-29 22:38:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-11-29 22:38:19,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 233. [2020-11-29 22:38:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-29 22:38:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2020-11-29 22:38:19,084 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 44 [2020-11-29 22:38:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:38:19,084 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2020-11-29 22:38:19,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-29 22:38:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2020-11-29 22:38:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 22:38:19,085 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:38:19,085 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:38:19,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-29 22:38:19,297 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:38:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:38:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1226650735, now seen corresponding path program 2 times [2020-11-29 22:38:19,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:38:19,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974580776] [2020-11-29 22:38:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:38:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:19,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:38:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:38:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:19,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974580776] [2020-11-29 22:38:19,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693947897] [2020-11-29 22:38:19,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:38:19,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:38:19,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:38:19,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 50 conjunts are in the unsatisfiable core [2020-11-29 22:38:19,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:38:19,712 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:38:19,712 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,716 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,716 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:38:19,760 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-29 22:38:19,760 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,770 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,770 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-11-29 22:38:19,801 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,801 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:19,801 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,809 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2020-11-29 22:38:19,871 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|], 2=[|v_#memory_int_38|]} [2020-11-29 22:38:19,874 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:19,875 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:19,894 INFO L384 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 27 treesize of output 11 [2020-11-29 22:38:19,894 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,906 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,906 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2020-11-29 22:38:19,973 INFO L384 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 8 [2020-11-29 22:38:19,973 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:19,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:19,993 INFO L545 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. [2020-11-29 22:38:19,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2020-11-29 22:38:20,080 INFO L384 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 21 treesize of output 20 [2020-11-29 22:38:20,081 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,099 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:20,100 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2020-11-29 22:38:20,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-29 22:38:20,136 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,154 INFO L545 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. [2020-11-29 22:38:20,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2020-11-29 22:38:20,204 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:38:20,204 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,218 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,218 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:20,219 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:32 [2020-11-29 22:38:20,261 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|], 6=[|v_#memory_int_41|]} [2020-11-29 22:38:20,266 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:38:20,266 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:38:20,295 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-29 22:38:20,295 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:20,313 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:38 [2020-11-29 22:38:20,369 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2020-11-29 22:38:20,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,383 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:20,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 [2020-11-29 22:38:20,495 INFO L384 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 5 treesize of output 3 [2020-11-29 22:38:20,496 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,535 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:20,535 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 52 [2020-11-29 22:38:20,536 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:20,577 INFO L625 ElimStorePlain]: treesize reduction 16, result has 74.6 percent of original size [2020-11-29 22:38:20,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:20,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-29 22:38:20,580 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:48, output treesize:47 [2020-11-29 22:38:20,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:26,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:38:26,256 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:38:26,257 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-29 22:38:26,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:38:26,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:38:26,268 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:38:26,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2020-11-29 22:38:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:38:26,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:38:26,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2020-11-29 22:38:26,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270182672] [2020-11-29 22:38:26,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-29 22:38:26,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:38:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-29 22:38:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=785, Unknown=10, NotChecked=0, Total=930 [2020-11-29 22:38:26,290 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand 31 states. [2020-11-29 22:38:36,175 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-11-29 22:38:38,672 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2020-11-29 22:39:10,616 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2020-11-29 22:39:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:39:10,927 INFO L93 Difference]: Finished difference Result 435 states and 523 transitions. [2020-11-29 22:39:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 22:39:10,928 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2020-11-29 22:39:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:39:10,930 INFO L225 Difference]: With dead ends: 435 [2020-11-29 22:39:10,931 INFO L226 Difference]: Without dead ends: 435 [2020-11-29 22:39:10,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=386, Invalid=1926, Unknown=40, NotChecked=0, Total=2352 [2020-11-29 22:39:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-11-29 22:39:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 279. [2020-11-29 22:39:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-11-29 22:39:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 337 transitions. [2020-11-29 22:39:10,940 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 337 transitions. Word has length 49 [2020-11-29 22:39:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:39:10,940 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 337 transitions. [2020-11-29 22:39:10,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-29 22:39:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 337 transitions. [2020-11-29 22:39:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 22:39:10,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:39:10,941 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:39:11,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-11-29 22:39:11,157 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:39:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:39:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 26518021, now seen corresponding path program 1 times [2020-11-29 22:39:11,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:39:11,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487268611] [2020-11-29 22:39:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:39:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:39:11,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:39:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:39:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:39:11,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487268611] [2020-11-29 22:39:11,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968666585] [2020-11-29 22:39:11,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:39:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:39:11,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-29 22:39:11,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:39:11,590 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:39:11,591 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:11,595 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,595 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:39:11,647 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-29 22:39:11,647 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:11,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-11-29 22:39:11,735 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:11,736 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-29 22:39:11,736 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,771 INFO L625 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2020-11-29 22:39:11,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2020-11-29 22:39:11,813 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|], 2=[|v_#memory_int_44|]} [2020-11-29 22:39:11,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:39:11,818 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:11,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:11,845 INFO L384 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 27 treesize of output 11 [2020-11-29 22:39:11,845 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:11,859 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2020-11-29 22:39:11,904 INFO L384 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 31 treesize of output 13 [2020-11-29 22:39:11,905 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:11,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:11,918 INFO L545 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. [2020-11-29 22:39:11,919 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:31 [2020-11-29 22:39:12,001 INFO L384 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 21 treesize of output 20 [2020-11-29 22:39:12,001 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:39:12,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2020-11-29 22:39:12,063 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-29 22:39:12,063 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,075 INFO L545 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. [2020-11-29 22:39:12,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2020-11-29 22:39:12,135 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:39:12,136 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,147 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:39:12,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2020-11-29 22:39:12,202 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_37|], 6=[|v_#memory_int_47|]} [2020-11-29 22:39:12,207 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:39:12,207 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:12,238 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-29 22:39:12,238 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,252 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:39:12,252 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48 [2020-11-29 22:39:12,306 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2020-11-29 22:39:12,307 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,323 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:39:12,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:36 [2020-11-29 22:39:12,449 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-11-29 22:39:12,450 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,469 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-29 22:39:12,469 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2020-11-29 22:39:12,632 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:39:12,633 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-29 22:39:12,635 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:12,649 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:12,649 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:50, output treesize:3 [2020-11-29 22:39:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:39:12,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:39:12,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2020-11-29 22:39:12,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662079643] [2020-11-29 22:39:12,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-29 22:39:12,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:39:12,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-29 22:39:12,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2020-11-29 22:39:12,673 INFO L87 Difference]: Start difference. First operand 279 states and 337 transitions. Second operand 31 states. [2020-11-29 22:39:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:39:26,259 INFO L93 Difference]: Finished difference Result 579 states and 696 transitions. [2020-11-29 22:39:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-11-29 22:39:26,259 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2020-11-29 22:39:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:39:26,262 INFO L225 Difference]: With dead ends: 579 [2020-11-29 22:39:26,262 INFO L226 Difference]: Without dead ends: 579 [2020-11-29 22:39:26,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=787, Invalid=4043, Unknown=0, NotChecked=0, Total=4830 [2020-11-29 22:39:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-11-29 22:39:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 283. [2020-11-29 22:39:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-11-29 22:39:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 340 transitions. [2020-11-29 22:39:26,273 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 340 transitions. Word has length 49 [2020-11-29 22:39:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:39:26,273 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 340 transitions. [2020-11-29 22:39:26,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-29 22:39:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 340 transitions. [2020-11-29 22:39:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 22:39:26,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:39:26,275 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:39:26,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-29 22:39:26,489 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:39:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:39:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash -269306609, now seen corresponding path program 1 times [2020-11-29 22:39:26,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:39:26,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582858896] [2020-11-29 22:39:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:39:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:39:26,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:39:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:39:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:39:26,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582858896] [2020-11-29 22:39:26,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200514846] [2020-11-29 22:39:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:39:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:39:27,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 54 conjunts are in the unsatisfiable core [2020-11-29 22:39:27,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:39:27,024 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:39:27,024 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,029 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:39:27,068 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:39:27,069 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,080 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,080 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2020-11-29 22:39:27,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,160 INFO L384 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 21 treesize of output 20 [2020-11-29 22:39:27,160 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,174 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2020-11-29 22:39:27,224 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,224 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:39:27,225 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,239 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2020-11-29 22:39:27,280 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_38|], 6=[|v_#memory_int_51|]} [2020-11-29 22:39:27,284 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:39:27,285 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 22:39:27,312 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:44 [2020-11-29 22:39:27,363 INFO L384 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 8 [2020-11-29 22:39:27,363 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,372 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,372 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2020-11-29 22:39:27,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,434 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-29 22:39:27,435 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,446 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,446 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2020-11-29 22:39:27,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,451 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2020-11-29 22:39:27,451 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,462 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2020-11-29 22:39:27,510 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,510 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:39:27,511 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,521 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,521 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:38 [2020-11-29 22:39:27,553 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_39|], 12=[|v_#memory_int_54|]} [2020-11-29 22:39:27,559 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:39:27,559 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,589 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2020-11-29 22:39:27,589 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,602 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,602 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:44 [2020-11-29 22:39:27,643 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2020-11-29 22:39:27,643 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,654 INFO L545 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. [2020-11-29 22:39:27,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:38 [2020-11-29 22:39:27,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:27,825 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:27,825 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 64 [2020-11-29 22:39:27,826 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:27,877 INFO L625 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2020-11-29 22:39:27,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:39:27,882 INFO L545 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. [2020-11-29 22:39:27,882 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:53 [2020-11-29 22:39:27,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:39:35,479 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 22:39:35,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:39:35,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:39:35,568 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-11-29 22:39:35,570 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:39:35,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:39:35,577 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:39:35,577 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2020-11-29 22:39:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:39:35,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:39:35,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2020-11-29 22:39:35,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692535255] [2020-11-29 22:39:35,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-11-29 22:39:35,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:39:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-11-29 22:39:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=995, Unknown=9, NotChecked=0, Total=1190 [2020-11-29 22:39:35,591 INFO L87 Difference]: Start difference. First operand 283 states and 340 transitions. Second operand 35 states. [2020-11-29 22:40:04,675 WARN L193 SmtUtils]: Spent 820.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-29 22:40:10,436 WARN L193 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-29 22:40:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:40:10,819 INFO L93 Difference]: Finished difference Result 413 states and 492 transitions. [2020-11-29 22:40:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-29 22:40:10,820 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 49 [2020-11-29 22:40:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:40:10,822 INFO L225 Difference]: With dead ends: 413 [2020-11-29 22:40:10,822 INFO L226 Difference]: Without dead ends: 413 [2020-11-29 22:40:10,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=457, Invalid=2177, Unknown=18, NotChecked=0, Total=2652 [2020-11-29 22:40:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-11-29 22:40:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 277. [2020-11-29 22:40:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-11-29 22:40:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 328 transitions. [2020-11-29 22:40:10,830 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 328 transitions. Word has length 49 [2020-11-29 22:40:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:40:10,830 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 328 transitions. [2020-11-29 22:40:10,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-11-29 22:40:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 328 transitions. [2020-11-29 22:40:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 22:40:10,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:40:10,831 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:40:11,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:11,032 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:40:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:40:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1226634454, now seen corresponding path program 2 times [2020-11-29 22:40:11,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:40:11,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295961077] [2020-11-29 22:40:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:40:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:11,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:40:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:11,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295961077] [2020-11-29 22:40:11,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548204877] [2020-11-29 22:40:11,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:11,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:40:11,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:40:11,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 57 conjunts are in the unsatisfiable core [2020-11-29 22:40:11,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:40:11,565 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:40:11,565 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:11,574 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,574 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:40:11,640 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:11,640 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-29 22:40:11,641 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,666 INFO L625 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-11-29 22:40:11,667 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,667 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-11-29 22:40:11,708 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:11,708 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:11,722 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2020-11-29 22:40:11,864 INFO L350 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2020-11-29 22:40:11,865 INFO L384 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 1 case distinctions, treesize of input 50 treesize of output 34 [2020-11-29 22:40:11,865 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,886 INFO L625 ElimStorePlain]: treesize reduction 12, result has 69.2 percent of original size [2020-11-29 22:40:11,886 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,886 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:27 [2020-11-29 22:40:11,937 INFO L350 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-11-29 22:40:11,937 INFO L384 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 1 case distinctions, treesize of input 46 treesize of output 32 [2020-11-29 22:40:11,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,958 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2020-11-29 22:40:11,959 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:11,959 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:27 [2020-11-29 22:40:12,021 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,022 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2020-11-29 22:40:12,022 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,072 INFO L625 ElimStorePlain]: treesize reduction 46, result has 57.0 percent of original size [2020-11-29 22:40:12,072 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:61 [2020-11-29 22:40:12,125 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_24|], 2=[|v_#memory_$Pointer$.base_43|]} [2020-11-29 22:40:12,130 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:40:12,130 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,178 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,178 INFO L384 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 1 case distinctions, treesize of input 54 treesize of output 69 [2020-11-29 22:40:12,179 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,231 INFO L625 ElimStorePlain]: treesize reduction 34, result has 63.0 percent of original size [2020-11-29 22:40:12,232 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,232 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:67 [2020-11-29 22:40:12,289 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2020-11-29 22:40:12,289 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,308 INFO L545 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. [2020-11-29 22:40:12,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:130, output treesize:103 [2020-11-29 22:40:12,423 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_56|], 6=[|v_#memory_$Pointer$.base_44|]} [2020-11-29 22:40:12,427 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2020-11-29 22:40:12,427 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:40:12,466 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,466 INFO L384 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 115 [2020-11-29 22:40:12,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 22:40:12,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:40:12,468 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,500 INFO L625 ElimStorePlain]: treesize reduction 100, result has 51.0 percent of original size [2020-11-29 22:40:12,500 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:12,500 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:171, output treesize:104 [2020-11-29 22:40:12,670 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2020-11-29 22:40:12,672 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:12,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,685 INFO L545 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. [2020-11-29 22:40:12,685 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:100, output treesize:76 [2020-11-29 22:40:12,759 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:40:12,765 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:12,765 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 45 [2020-11-29 22:40:12,766 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 22:40:12,766 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 22:40:12,767 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:12,791 INFO L625 ElimStorePlain]: treesize reduction 16, result has 68.0 percent of original size [2020-11-29 22:40:12,801 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:12,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:28 [2020-11-29 22:40:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:15,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:40:15,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2020-11-29 22:40:15,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326180086] [2020-11-29 22:40:15,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-29 22:40:15,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:40:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-29 22:40:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=957, Unknown=1, NotChecked=0, Total=1122 [2020-11-29 22:40:15,025 INFO L87 Difference]: Start difference. First operand 277 states and 328 transitions. Second operand 34 states. [2020-11-29 22:40:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:40:23,988 INFO L93 Difference]: Finished difference Result 348 states and 409 transitions. [2020-11-29 22:40:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-29 22:40:23,989 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2020-11-29 22:40:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:40:23,991 INFO L225 Difference]: With dead ends: 348 [2020-11-29 22:40:23,991 INFO L226 Difference]: Without dead ends: 348 [2020-11-29 22:40:23,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=514, Invalid=2240, Unknown=2, NotChecked=0, Total=2756 [2020-11-29 22:40:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-11-29 22:40:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 277. [2020-11-29 22:40:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-11-29 22:40:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 327 transitions. [2020-11-29 22:40:23,999 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 327 transitions. Word has length 49 [2020-11-29 22:40:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:40:24,001 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 327 transitions. [2020-11-29 22:40:24,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-29 22:40:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 327 transitions. [2020-11-29 22:40:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 22:40:24,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:40:24,004 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:40:24,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-11-29 22:40:24,217 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:40:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:40:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1226634455, now seen corresponding path program 2 times [2020-11-29 22:40:24,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:40:24,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729223927] [2020-11-29 22:40:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:40:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:24,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:40:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:24,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729223927] [2020-11-29 22:40:24,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027079646] [2020-11-29 22:40:24,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:24,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:40:24,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:40:24,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 59 conjunts are in the unsatisfiable core [2020-11-29 22:40:24,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:40:24,997 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:40:24,997 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,008 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,008 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:40:25,093 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,094 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-29 22:40:25,094 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,123 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-11-29 22:40:25,123 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,123 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-11-29 22:40:25,172 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:25,172 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,191 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:25,191 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,209 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,209 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2020-11-29 22:40:25,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:40:25,367 INFO L384 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 27 treesize of output 11 [2020-11-29 22:40:25,367 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,378 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,395 INFO L350 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2020-11-29 22:40:25,395 INFO L384 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 1 case distinctions, treesize of input 44 treesize of output 30 [2020-11-29 22:40:25,396 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,414 INFO L625 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2020-11-29 22:40:25,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,415 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:32 [2020-11-29 22:40:25,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:40:25,446 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-29 22:40:25,446 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,476 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-11-29 22:40:25,476 INFO L384 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 1 case distinctions, treesize of input 40 treesize of output 28 [2020-11-29 22:40:25,476 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,498 INFO L625 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2020-11-29 22:40:25,498 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,498 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:35 [2020-11-29 22:40:25,543 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,543 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:40:25,543 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2020-11-29 22:40:25,602 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-11-29 22:40:25,602 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,618 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,621 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-11-29 22:40:25,622 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,638 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:52 [2020-11-29 22:40:25,789 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_29|], 6=[|v_#memory_$Pointer$.base_49|]} [2020-11-29 22:40:25,793 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 11 [2020-11-29 22:40:25,793 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,852 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:25,852 INFO L384 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 129 [2020-11-29 22:40:25,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-29 22:40:25,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:40:25,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 22:40:25,855 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:25,904 INFO L625 ElimStorePlain]: treesize reduction 124, result has 34.4 percent of original size [2020-11-29 22:40:25,905 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:25,905 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2020-11-29 22:40:26,066 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-29 22:40:26,068 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-29 22:40:26,069 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:26,079 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:26,086 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:26,087 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2020-11-29 22:40:26,087 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-29 22:40:26,088 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:26,101 INFO L625 ElimStorePlain]: treesize reduction 11, result has 62.1 percent of original size [2020-11-29 22:40:26,102 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:26,102 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:9 [2020-11-29 22:40:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:26,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:40:26,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2020-11-29 22:40:26,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181119821] [2020-11-29 22:40:26,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-29 22:40:26,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:40:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-29 22:40:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2020-11-29 22:40:26,118 INFO L87 Difference]: Start difference. First operand 277 states and 327 transitions. Second operand 31 states. [2020-11-29 22:40:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:40:28,446 INFO L93 Difference]: Finished difference Result 350 states and 407 transitions. [2020-11-29 22:40:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-29 22:40:28,447 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2020-11-29 22:40:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:40:28,449 INFO L225 Difference]: With dead ends: 350 [2020-11-29 22:40:28,449 INFO L226 Difference]: Without dead ends: 350 [2020-11-29 22:40:28,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=368, Invalid=1984, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 22:40:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-11-29 22:40:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 274. [2020-11-29 22:40:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-11-29 22:40:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 318 transitions. [2020-11-29 22:40:28,459 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 318 transitions. Word has length 49 [2020-11-29 22:40:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:40:28,459 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 318 transitions. [2020-11-29 22:40:28,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-29 22:40:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 318 transitions. [2020-11-29 22:40:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 22:40:28,461 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:40:28,461 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:40:28,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-29 22:40:28,689 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:40:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:40:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1256197166, now seen corresponding path program 1 times [2020-11-29 22:40:28,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:40:28,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443602944] [2020-11-29 22:40:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:40:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:28,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:40:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 22:40:28,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443602944] [2020-11-29 22:40:28,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323240776] [2020-11-29 22:40:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:29,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 57 conjunts are in the unsatisfiable core [2020-11-29 22:40:29,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:40:29,140 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_47|], 1=[|v_#valid_90|]} [2020-11-29 22:40:29,144 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:40:29,144 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,167 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,167 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:40:29,168 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,176 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,176 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2020-11-29 22:40:29,205 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:29,205 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:29,228 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,242 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,242 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2020-11-29 22:40:29,327 INFO L384 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 43 treesize of output 13 [2020-11-29 22:40:29,327 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,352 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,353 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2020-11-29 22:40:29,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:40:29,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:40:29,354 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,372 INFO L625 ElimStorePlain]: treesize reduction 36, result has 48.6 percent of original size [2020-11-29 22:40:29,372 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,372 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:34 [2020-11-29 22:40:29,555 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-11-29 22:40:29,556 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:29,563 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:32 [2020-11-29 22:40:29,571 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,572 INFO L384 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 27 treesize of output 23 [2020-11-29 22:40:29,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:29,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:29,573 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:29,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,626 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,627 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2020-11-29 22:40:29,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:29,628 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-29 22:40:29,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:29,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:40:29,642 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:29,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:30 [2020-11-29 22:40:29,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:40:29,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:40:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:29,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:40:29,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 29 [2020-11-29 22:40:29,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742839206] [2020-11-29 22:40:29,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-29 22:40:29,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:40:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-29 22:40:29,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2020-11-29 22:40:29,728 INFO L87 Difference]: Start difference. First operand 274 states and 318 transitions. Second operand 30 states. [2020-11-29 22:40:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:40:31,695 INFO L93 Difference]: Finished difference Result 320 states and 363 transitions. [2020-11-29 22:40:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-29 22:40:31,696 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 50 [2020-11-29 22:40:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:40:31,697 INFO L225 Difference]: With dead ends: 320 [2020-11-29 22:40:31,697 INFO L226 Difference]: Without dead ends: 320 [2020-11-29 22:40:31,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=438, Invalid=1914, Unknown=0, NotChecked=0, Total=2352 [2020-11-29 22:40:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-11-29 22:40:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 279. [2020-11-29 22:40:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-11-29 22:40:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 323 transitions. [2020-11-29 22:40:31,705 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 323 transitions. Word has length 50 [2020-11-29 22:40:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:40:31,705 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 323 transitions. [2020-11-29 22:40:31,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-29 22:40:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 323 transitions. [2020-11-29 22:40:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 22:40:31,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:40:31,706 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:40:31,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:31,906 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:40:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:40:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 604218757, now seen corresponding path program 2 times [2020-11-29 22:40:31,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:40:31,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353471789] [2020-11-29 22:40:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:40:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:32,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:40:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:32,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353471789] [2020-11-29 22:40:32,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371139752] [2020-11-29 22:40:32,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:32,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:40:32,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:40:32,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2020-11-29 22:40:32,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:40:32,309 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:40:32,309 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,313 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:40:32,354 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-29 22:40:32,354 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,363 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2020-11-29 22:40:32,406 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,406 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-29 22:40:32,407 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,435 INFO L625 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2020-11-29 22:40:32,436 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,436 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2020-11-29 22:40:32,474 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_52|], 2=[|v_#memory_int_58|]} [2020-11-29 22:40:32,478 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:32,478 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:40:32,502 INFO L384 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 27 treesize of output 11 [2020-11-29 22:40:32,502 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,528 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,528 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2020-11-29 22:40:32,569 INFO L384 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 31 treesize of output 13 [2020-11-29 22:40:32,569 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,580 INFO L545 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. [2020-11-29 22:40:32,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:31 [2020-11-29 22:40:32,666 INFO L384 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 21 treesize of output 20 [2020-11-29 22:40:32,666 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,679 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:32,679 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2020-11-29 22:40:32,708 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-29 22:40:32,708 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,721 INFO L545 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. [2020-11-29 22:40:32,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2020-11-29 22:40:32,772 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,772 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:40:32,773 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,786 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:32,786 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2020-11-29 22:40:32,834 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_53|], 6=[|v_#memory_int_61|]} [2020-11-29 22:40:32,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:32,838 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,862 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:40:32,866 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-29 22:40:32,866 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,882 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:32,882 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48 [2020-11-29 22:40:32,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2020-11-29 22:40:32,930 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:32,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:32,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:32,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:36 [2020-11-29 22:40:33,051 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-11-29 22:40:33,051 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:33,065 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:33,067 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:33,067 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2020-11-29 22:40:33,222 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:40:33,223 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-11-29 22:40:33,224 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:33,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:33,241 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:33,242 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:50, output treesize:3 [2020-11-29 22:40:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:33,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:40:33,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-11-29 22:40:33,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508805736] [2020-11-29 22:40:33,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-11-29 22:40:33,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:40:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-11-29 22:40:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2020-11-29 22:40:33,297 INFO L87 Difference]: Start difference. First operand 279 states and 323 transitions. Second operand 32 states. [2020-11-29 22:40:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:40:46,260 INFO L93 Difference]: Finished difference Result 558 states and 641 transitions. [2020-11-29 22:40:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-11-29 22:40:46,261 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 52 [2020-11-29 22:40:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:40:46,263 INFO L225 Difference]: With dead ends: 558 [2020-11-29 22:40:46,263 INFO L226 Difference]: Without dead ends: 558 [2020-11-29 22:40:46,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=777, Invalid=3915, Unknown=0, NotChecked=0, Total=4692 [2020-11-29 22:40:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-11-29 22:40:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 279. [2020-11-29 22:40:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-11-29 22:40:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 320 transitions. [2020-11-29 22:40:46,272 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 320 transitions. Word has length 52 [2020-11-29 22:40:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:40:46,272 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 320 transitions. [2020-11-29 22:40:46,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-11-29 22:40:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 320 transitions. [2020-11-29 22:40:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 22:40:46,273 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:40:46,274 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:40:46,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-11-29 22:40:46,489 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:40:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:40:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash -880353051, now seen corresponding path program 1 times [2020-11-29 22:40:46,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:40:46,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27211946] [2020-11-29 22:40:46,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:40:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:46,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:40:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:46,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27211946] [2020-11-29 22:40:46,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112480240] [2020-11-29 22:40:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:40:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:40:46,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 48 conjunts are in the unsatisfiable core [2020-11-29 22:40:46,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:40:46,965 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:46,965 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:40:46,966 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:46,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:46,973 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:46,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2020-11-29 22:40:47,001 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:40:47,001 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:47,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:47,012 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:40:47,013 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2020-11-29 22:40:47,134 INFO L350 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2020-11-29 22:40:47,134 INFO L384 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 1 case distinctions, treesize of input 49 treesize of output 33 [2020-11-29 22:40:47,135 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:47,155 INFO L625 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2020-11-29 22:40:47,156 INFO L545 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. [2020-11-29 22:40:47,156 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:29 [2020-11-29 22:40:47,209 INFO L350 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-11-29 22:40:47,209 INFO L384 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 1 case distinctions, treesize of input 45 treesize of output 31 [2020-11-29 22:40:47,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:47,229 INFO L625 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2020-11-29 22:40:47,230 INFO L545 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. [2020-11-29 22:40:47,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:29 [2020-11-29 22:40:47,263 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:47,263 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:40:47,263 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:47,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:47,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:47,272 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:40 [2020-11-29 22:40:47,324 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:47,324 INFO L384 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 1 case distinctions, treesize of input 43 treesize of output 64 [2020-11-29 22:40:47,324 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:47,351 INFO L625 ElimStorePlain]: treesize reduction 34, result has 52.1 percent of original size [2020-11-29 22:40:47,352 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:47,352 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:34 [2020-11-29 22:40:47,554 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:47,554 INFO L384 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 132 [2020-11-29 22:40:47,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-29 22:40:47,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:47,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 22:40:47,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,558 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:40:47,559 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,559 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,561 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,562 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 22:40:47,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:40:47,564 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,564 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 22:40:47,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:40:47,565 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,566 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,568 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:40:47,568 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:40:47,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:40:47,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,570 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:40:47,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:40:47,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:40:47,572 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 13 xjuncts. [2020-11-29 22:40:47,705 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-11-29 22:40:47,706 INFO L625 ElimStorePlain]: treesize reduction 1738, result has 3.9 percent of original size [2020-11-29 22:40:47,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:47,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:40:47,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:94, output treesize:71 [2020-11-29 22:40:47,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:47,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:47,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:47,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:48,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:48,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:48,363 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-11-29 22:40:48,363 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:40:48,373 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:48,379 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:48,379 INFO L384 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 30 treesize of output 24 [2020-11-29 22:40:48,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:48,381 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-29 22:40:48,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:40:48,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:40:48,392 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-29 22:40:48,392 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2020-11-29 22:40:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:40:48,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:40:48,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2020-11-29 22:40:48,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625408019] [2020-11-29 22:40:48,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-11-29 22:40:48,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:40:48,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-11-29 22:40:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2020-11-29 22:40:48,476 INFO L87 Difference]: Start difference. First operand 279 states and 320 transitions. Second operand 33 states. [2020-11-29 22:42:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:42:31,213 INFO L93 Difference]: Finished difference Result 532 states and 616 transitions. [2020-11-29 22:42:31,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-11-29 22:42:31,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2020-11-29 22:42:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:42:31,216 INFO L225 Difference]: With dead ends: 532 [2020-11-29 22:42:31,216 INFO L226 Difference]: Without dead ends: 530 [2020-11-29 22:42:31,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=915, Invalid=5726, Unknown=1, NotChecked=0, Total=6642 [2020-11-29 22:42:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-29 22:42:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 343. [2020-11-29 22:42:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-11-29 22:42:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 405 transitions. [2020-11-29 22:42:31,228 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 405 transitions. Word has length 52 [2020-11-29 22:42:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:42:31,229 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 405 transitions. [2020-11-29 22:42:31,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-11-29 22:42:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 405 transitions. [2020-11-29 22:42:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 22:42:31,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:42:31,230 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:42:31,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:42:31,445 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:42:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:42:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1319614471, now seen corresponding path program 1 times [2020-11-29 22:42:31,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:42:31,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696537943] [2020-11-29 22:42:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:42:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:31,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:42:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 22:42:31,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696537943] [2020-11-29 22:42:31,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900483032] [2020-11-29 22:42:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:42:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:31,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-29 22:42:31,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:42:31,844 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:31,844 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:42:31,845 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:31,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:31,854 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:31,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-11-29 22:42:31,886 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:42:31,886 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:31,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:31,897 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:31,898 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2020-11-29 22:42:32,043 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:32,043 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 65 [2020-11-29 22:42:32,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:42:32,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:42:32,044 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:32,064 INFO L625 ElimStorePlain]: treesize reduction 36, result has 44.6 percent of original size [2020-11-29 22:42:32,064 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:32,064 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:29 [2020-11-29 22:42:32,441 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-11-29 22:42:32,442 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:32,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:32,454 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:32,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:26 [2020-11-29 22:42:32,472 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:32,473 INFO L384 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 29 treesize of output 23 [2020-11-29 22:42:32,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:42:32,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:32,477 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-29 22:42:32,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:32,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:32,509 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-29 22:42:32,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2020-11-29 22:42:32,545 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 22:42:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:32,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:42:32,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 28 [2020-11-29 22:42:32,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800607938] [2020-11-29 22:42:32,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-29 22:42:32,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:42:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-29 22:42:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2020-11-29 22:42:32,608 INFO L87 Difference]: Start difference. First operand 343 states and 405 transitions. Second operand 29 states. [2020-11-29 22:42:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:42:34,317 INFO L93 Difference]: Finished difference Result 379 states and 440 transitions. [2020-11-29 22:42:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-29 22:42:34,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2020-11-29 22:42:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:42:34,320 INFO L225 Difference]: With dead ends: 379 [2020-11-29 22:42:34,320 INFO L226 Difference]: Without dead ends: 379 [2020-11-29 22:42:34,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2020-11-29 22:42:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-11-29 22:42:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 341. [2020-11-29 22:42:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-11-29 22:42:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 403 transitions. [2020-11-29 22:42:34,329 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 403 transitions. Word has length 53 [2020-11-29 22:42:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:42:34,329 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 403 transitions. [2020-11-29 22:42:34,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-29 22:42:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 403 transitions. [2020-11-29 22:42:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-29 22:42:34,330 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:42:34,331 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:42:34,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-11-29 22:42:34,531 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:42:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:42:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash -798827737, now seen corresponding path program 1 times [2020-11-29 22:42:34,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:42:34,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922691861] [2020-11-29 22:42:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:42:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:35,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:42:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 22:42:35,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922691861] [2020-11-29 22:42:35,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810793454] [2020-11-29 22:42:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:42:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:35,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 44 conjunts are in the unsatisfiable core [2020-11-29 22:42:35,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:42:35,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:42:35,411 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:35,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:35,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:35,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2020-11-29 22:42:35,639 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:35,639 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 75 [2020-11-29 22:42:35,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2020-11-29 22:42:35,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:42:35,641 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:35,667 INFO L625 ElimStorePlain]: treesize reduction 36, result has 53.2 percent of original size [2020-11-29 22:42:35,667 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:35,667 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:41 [2020-11-29 22:42:35,943 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:35,944 INFO L384 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 39 treesize of output 33 [2020-11-29 22:42:35,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:35,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:35,946 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:35,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:35,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:35,971 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:35,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:41 [2020-11-29 22:42:35,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:36,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:42:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 22:42:36,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:42:36,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2020-11-29 22:42:36,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748387466] [2020-11-29 22:42:36,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-29 22:42:36,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:42:36,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-29 22:42:36,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2020-11-29 22:42:36,457 INFO L87 Difference]: Start difference. First operand 341 states and 403 transitions. Second operand 30 states. [2020-11-29 22:42:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:42:39,283 INFO L93 Difference]: Finished difference Result 366 states and 428 transitions. [2020-11-29 22:42:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-29 22:42:39,283 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2020-11-29 22:42:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:42:39,285 INFO L225 Difference]: With dead ends: 366 [2020-11-29 22:42:39,285 INFO L226 Difference]: Without dead ends: 361 [2020-11-29 22:42:39,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=221, Invalid=1671, Unknown=0, NotChecked=0, Total=1892 [2020-11-29 22:42:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-11-29 22:42:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 337. [2020-11-29 22:42:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-11-29 22:42:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2020-11-29 22:42:39,292 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 56 [2020-11-29 22:42:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:42:39,293 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2020-11-29 22:42:39,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-29 22:42:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2020-11-29 22:42:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 22:42:39,294 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:42:39,294 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:42:39,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-11-29 22:42:39,517 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:42:39,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:42:39,517 INFO L82 PathProgramCache]: Analyzing trace with hash 103547695, now seen corresponding path program 2 times [2020-11-29 22:42:39,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:42:39,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668384349] [2020-11-29 22:42:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:42:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:40,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:42:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:40,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668384349] [2020-11-29 22:42:40,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898778418] [2020-11-29 22:42:40,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:42:40,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 22:42:40,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 22:42:40,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 74 conjunts are in the unsatisfiable core [2020-11-29 22:42:40,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:42:40,761 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:42:40,761 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:40,767 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,767 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:42:40,853 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:40,853 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-11-29 22:42:40,854 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,888 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-11-29 22:42:40,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-11-29 22:42:40,938 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:42:40,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:40,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:42:40,966 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:40,989 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:40,989 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2020-11-29 22:42:41,095 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 2=[|v_#memory_$Pointer$.base_64|, |v_#memory_$Pointer$.offset_33|]} [2020-11-29 22:42:41,099 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:42:41,099 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,139 INFO L625 ElimStorePlain]: treesize reduction 5, result has 95.4 percent of original size [2020-11-29 22:42:41,162 INFO L350 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2020-11-29 22:42:41,163 INFO L384 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 1 case distinctions, treesize of input 50 treesize of output 34 [2020-11-29 22:42:41,163 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,196 INFO L625 ElimStorePlain]: treesize reduction 12, result has 85.9 percent of original size [2020-11-29 22:42:41,200 INFO L384 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 38 treesize of output 16 [2020-11-29 22:42:41,200 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,213 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,213 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:45 [2020-11-29 22:42:41,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:41,330 INFO L384 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 22 treesize of output 21 [2020-11-29 22:42:41,330 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,388 INFO L350 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2020-11-29 22:42:41,388 INFO L384 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 1 case distinctions, treesize of input 46 treesize of output 32 [2020-11-29 22:42:41,389 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,441 INFO L625 ElimStorePlain]: treesize reduction 10, result has 88.9 percent of original size [2020-11-29 22:42:41,452 INFO L384 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 34 treesize of output 16 [2020-11-29 22:42:41,452 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,472 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,472 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,472 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:65 [2020-11-29 22:42:41,562 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,562 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:42:41,562 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,581 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,581 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:63 [2020-11-29 22:42:41,629 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_66|, |v_#memory_$Pointer$.offset_35|], 6=[|v_#memory_int_65|]} [2020-11-29 22:42:41,635 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-11-29 22:42:41,635 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,673 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2020-11-29 22:42:41,673 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:41,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:41,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:41,712 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2020-11-29 22:42:41,712 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,739 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,739 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:108, output treesize:75 [2020-11-29 22:42:41,940 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2020-11-29 22:42:41,940 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:41,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:41,974 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_36|], 6=[|v_#memory_int_66|, |v_#memory_$Pointer$.base_67|]} [2020-11-29 22:42:41,978 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 16 [2020-11-29 22:42:41,978 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:42,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:42,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:42,011 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2020-11-29 22:42:42,011 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:42,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:42,084 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:42,084 INFO L384 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 156 [2020-11-29 22:42:42,086 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,086 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,090 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 22:42:42,090 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,091 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,094 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,095 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,099 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,100 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,106 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,107 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,109 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,110 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,114 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,116 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,120 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 22:42:42,121 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,122 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,127 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,128 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,133 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,134 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,139 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,141 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,146 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-11-29 22:42:42,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,147 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:42:42,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:42:42,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:42:42,151 INFO L545 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:42,254 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-11-29 22:42:42,255 INFO L625 ElimStorePlain]: treesize reduction 84, result has 48.5 percent of original size [2020-11-29 22:42:42,257 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:42,257 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:256, output treesize:121 [2020-11-29 22:42:42,650 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2020-11-29 22:42:42,655 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:42,655 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-11-29 22:42:42,656 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:42,723 INFO L625 ElimStorePlain]: treesize reduction 10, result has 91.9 percent of original size [2020-11-29 22:42:42,734 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:42,735 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:42,751 INFO L350 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-11-29 22:42:42,752 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 50 [2020-11-29 22:42:42,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:42:42,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:42:42,754 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:42,808 INFO L625 ElimStorePlain]: treesize reduction 4, result has 93.2 percent of original size [2020-11-29 22:42:42,811 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:42,811 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:145, output treesize:38 [2020-11-29 22:42:43,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:43,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:43,017 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:43,018 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2020-11-29 22:42:43,019 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:43,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:43,030 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:43,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:4 [2020-11-29 22:42:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:43,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:42:43,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2020-11-29 22:42:43,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381542412] [2020-11-29 22:42:43,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-11-29 22:42:43,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:42:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-11-29 22:42:43,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2020-11-29 22:42:43,069 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand 40 states. [2020-11-29 22:42:45,047 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2020-11-29 22:42:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:42:52,703 INFO L93 Difference]: Finished difference Result 417 states and 476 transitions. [2020-11-29 22:42:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-29 22:42:52,704 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2020-11-29 22:42:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:42:52,705 INFO L225 Difference]: With dead ends: 417 [2020-11-29 22:42:52,706 INFO L226 Difference]: Without dead ends: 417 [2020-11-29 22:42:52,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=378, Invalid=2814, Unknown=0, NotChecked=0, Total=3192 [2020-11-29 22:42:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-29 22:42:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 335. [2020-11-29 22:42:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-11-29 22:42:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 394 transitions. [2020-11-29 22:42:52,712 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 394 transitions. Word has length 57 [2020-11-29 22:42:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:42:52,712 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 394 transitions. [2020-11-29 22:42:52,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-11-29 22:42:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 394 transitions. [2020-11-29 22:42:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 22:42:52,714 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:42:52,714 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:42:52,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:42:52,929 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:42:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:42:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash -192276935, now seen corresponding path program 1 times [2020-11-29 22:42:52,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:42:52,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364895008] [2020-11-29 22:42:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:42:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:53,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:42:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:53,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364895008] [2020-11-29 22:42:53,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258225373] [2020-11-29 22:42:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:42:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:42:53,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 68 conjunts are in the unsatisfiable core [2020-11-29 22:42:53,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:42:53,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:42:53,800 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:53,804 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,804 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:42:53,854 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:53,855 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:42:53,855 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:53,863 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,863 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-11-29 22:42:53,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:42:53,900 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:53,917 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:42:53,917 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:53,931 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:53,931 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:34 [2020-11-29 22:42:54,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:54,055 INFO L384 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 34 treesize of output 14 [2020-11-29 22:42:54,056 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:54,075 INFO L384 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 35 treesize of output 15 [2020-11-29 22:42:54,076 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,087 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,087 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:39 [2020-11-29 22:42:54,130 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_67|], 2=[|v_#memory_$Pointer$.base_70|, |v_#memory_$Pointer$.offset_39|]} [2020-11-29 22:42:54,134 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-29 22:42:54,134 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,162 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-29 22:42:54,162 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,184 INFO L384 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 30 treesize of output 14 [2020-11-29 22:42:54,185 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,200 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:49 [2020-11-29 22:42:54,283 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,284 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:42:54,284 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,310 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,311 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2020-11-29 22:42:54,372 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-11-29 22:42:54,373 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,413 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,417 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-11-29 22:42:54,418 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,470 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.2 percent of original size [2020-11-29 22:42:54,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:42:54,475 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-29 22:42:54,475 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,494 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,494 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:55 [2020-11-29 22:42:54,682 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_41|, |v_#memory_int_69|], 6=[|v_#memory_$Pointer$.base_72|]} [2020-11-29 22:42:54,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 14 [2020-11-29 22:42:54,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,718 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2020-11-29 22:42:54,722 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,740 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,745 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:54,780 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,781 INFO L384 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 126 [2020-11-29 22:42:54,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-29 22:42:54,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 22:42:54,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 22:42:54,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-29 22:42:54,783 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,819 INFO L625 ElimStorePlain]: treesize reduction 100, result has 44.8 percent of original size [2020-11-29 22:42:54,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:54,820 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:185, output treesize:81 [2020-11-29 22:42:54,956 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-29 22:42:54,959 INFO L384 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 22 treesize of output 10 [2020-11-29 22:42:54,959 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:54,975 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,977 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:54,981 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:54,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 37 [2020-11-29 22:42:54,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:42:54,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:42:54,983 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:55,011 INFO L625 ElimStorePlain]: treesize reduction 4, result has 90.0 percent of original size [2020-11-29 22:42:55,012 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:42:55,012 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:92, output treesize:28 [2020-11-29 22:42:55,161 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:42:55,162 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-29 22:42:55,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:42:55,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:42:55,174 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:42:55,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:3 [2020-11-29 22:42:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:42:55,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:42:55,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2020-11-29 22:42:55,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77802744] [2020-11-29 22:42:55,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-11-29 22:42:55,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:42:55,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-11-29 22:42:55,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2020-11-29 22:42:55,196 INFO L87 Difference]: Start difference. First operand 335 states and 394 transitions. Second operand 36 states. [2020-11-29 22:43:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:43:03,982 INFO L93 Difference]: Finished difference Result 446 states and 504 transitions. [2020-11-29 22:43:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-29 22:43:03,983 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 57 [2020-11-29 22:43:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:43:03,984 INFO L225 Difference]: With dead ends: 446 [2020-11-29 22:43:03,984 INFO L226 Difference]: Without dead ends: 446 [2020-11-29 22:43:03,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=459, Invalid=2963, Unknown=0, NotChecked=0, Total=3422 [2020-11-29 22:43:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-11-29 22:43:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 335. [2020-11-29 22:43:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-11-29 22:43:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 393 transitions. [2020-11-29 22:43:03,991 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 393 transitions. Word has length 57 [2020-11-29 22:43:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:43:03,991 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 393 transitions. [2020-11-29 22:43:03,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-11-29 22:43:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 393 transitions. [2020-11-29 22:43:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 22:43:03,993 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:43:03,993 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:43:04,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-11-29 22:43:04,213 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:43:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:43:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1999593841, now seen corresponding path program 1 times [2020-11-29 22:43:04,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:43:04,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009000636] [2020-11-29 22:43:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:43:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:43:04,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:43:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:43:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:43:05,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009000636] [2020-11-29 22:43:05,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887662415] [2020-11-29 22:43:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:43:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:43:05,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 70 conjunts are in the unsatisfiable core [2020-11-29 22:43:05,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:43:05,186 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:43:05,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,192 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:43:05,250 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_48|], 1=[|v_#valid_109|]} [2020-11-29 22:43:05,254 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:43:05,254 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,278 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:43:05,278 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,291 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,291 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2020-11-29 22:43:05,340 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:43:05,340 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:43:05,368 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,392 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,392 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2020-11-29 22:43:05,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:05,595 INFO L384 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 44 treesize of output 20 [2020-11-29 22:43:05,596 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:05,627 INFO L384 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 34 treesize of output 14 [2020-11-29 22:43:05,627 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,646 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,646 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2020-11-29 22:43:05,719 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_70|], 2=[|v_#memory_$Pointer$.base_75|, |v_#memory_$Pointer$.offset_44|]} [2020-11-29 22:43:05,725 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2020-11-29 22:43:05,725 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:05,761 INFO L384 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 40 treesize of output 20 [2020-11-29 22:43:05,762 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:05,791 INFO L384 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 30 treesize of output 14 [2020-11-29 22:43:05,792 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,813 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,813 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:62 [2020-11-29 22:43:05,898 INFO L441 ElimStorePlain]: Different costs {1=[|v_#length_49|], 3=[|v_#valid_110|]} [2020-11-29 22:43:05,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:05,904 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2020-11-29 22:43:05,905 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:05,943 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,944 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:43:05,944 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:05,965 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:05,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2020-11-29 22:43:06,039 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:06,049 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 45 [2020-11-29 22:43:06,050 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,129 INFO L625 ElimStorePlain]: treesize reduction 20, result has 82.5 percent of original size [2020-11-29 22:43:06,149 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 51 [2020-11-29 22:43:06,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:43:06,150 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,222 INFO L625 ElimStorePlain]: treesize reduction 32, result has 73.8 percent of original size [2020-11-29 22:43:06,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:06,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-29 22:43:06,227 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,253 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,253 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:110, output treesize:71 [2020-11-29 22:43:06,453 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_46|, |v_#memory_int_72|], 6=[|v_#memory_$Pointer$.base_77|]} [2020-11-29 22:43:06,457 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 14 [2020-11-29 22:43:06,457 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,486 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2020-11-29 22:43:06,487 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,513 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:06,549 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,549 INFO L384 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 136 [2020-11-29 22:43:06,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,550 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,553 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 22:43:06,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,555 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,561 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,567 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,571 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,575 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,578 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,581 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-29 22:43:06,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,582 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,586 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,590 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,594 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:06,597 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-29 22:43:06,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:06,602 INFO L545 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:06,664 INFO L625 ElimStorePlain]: treesize reduction 70, result has 49.6 percent of original size [2020-11-29 22:43:06,665 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:06,666 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:105 [2020-11-29 22:43:06,828 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-29 22:43:06,832 INFO L384 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 22 treesize of output 10 [2020-11-29 22:43:06,832 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:06,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,856 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:06,860 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:06,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 47 [2020-11-29 22:43:06,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:43:06,872 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:06,908 INFO L625 ElimStorePlain]: treesize reduction 4, result has 92.0 percent of original size [2020-11-29 22:43:06,909 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:06,909 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:38 [2020-11-29 22:43:07,099 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2020-11-29 22:43:07,100 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:07,123 INFO L625 ElimStorePlain]: treesize reduction 3, result has 91.2 percent of original size [2020-11-29 22:43:07,123 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:07,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:31 [2020-11-29 22:43:07,208 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:07,208 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-29 22:43:07,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:07,219 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:07,221 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:07,221 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:38, output treesize:3 [2020-11-29 22:43:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:43:07,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:43:07,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2020-11-29 22:43:07,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192095608] [2020-11-29 22:43:07,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-29 22:43:07,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:43:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-29 22:43:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2020-11-29 22:43:07,247 INFO L87 Difference]: Start difference. First operand 335 states and 393 transitions. Second operand 38 states. [2020-11-29 22:43:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:43:17,907 INFO L93 Difference]: Finished difference Result 469 states and 543 transitions. [2020-11-29 22:43:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-29 22:43:17,908 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 57 [2020-11-29 22:43:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:43:17,910 INFO L225 Difference]: With dead ends: 469 [2020-11-29 22:43:17,910 INFO L226 Difference]: Without dead ends: 469 [2020-11-29 22:43:17,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=483, Invalid=3299, Unknown=0, NotChecked=0, Total=3782 [2020-11-29 22:43:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-11-29 22:43:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 335. [2020-11-29 22:43:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-11-29 22:43:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 393 transitions. [2020-11-29 22:43:17,916 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 393 transitions. Word has length 57 [2020-11-29 22:43:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:43:17,916 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 393 transitions. [2020-11-29 22:43:17,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-11-29 22:43:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 393 transitions. [2020-11-29 22:43:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 22:43:17,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:43:17,918 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:43:18,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:43:18,137 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:43:18,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:43:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1999548825, now seen corresponding path program 1 times [2020-11-29 22:43:18,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:43:18,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932084442] [2020-11-29 22:43:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:43:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:43:19,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-29 22:43:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:43:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:43:19,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932084442] [2020-11-29 22:43:19,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190581703] [2020-11-29 22:43:19,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 22:43:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:43:19,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 72 conjunts are in the unsatisfiable core [2020-11-29 22:43:19,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 22:43:19,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-29 22:43:19,465 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,470 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,470 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-29 22:43:19,541 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,542 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-29 22:43:19,542 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2020-11-29 22:43:19,612 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:43:19,613 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,667 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-29 22:43:19,667 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,688 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,689 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:34 [2020-11-29 22:43:19,876 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_73|], 2=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_79|]} [2020-11-29 22:43:19,881 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2020-11-29 22:43:19,882 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:19,915 INFO L384 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 34 treesize of output 14 [2020-11-29 22:43:19,915 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,936 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:19,942 INFO L384 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 35 treesize of output 15 [2020-11-29 22:43:19,942 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,956 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:19,957 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:19,957 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:94, output treesize:39 [2020-11-29 22:43:20,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:20,096 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-11-29 22:43:20,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,127 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-11-29 22:43:20,128 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,176 INFO L384 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 30 treesize of output 14 [2020-11-29 22:43:20,176 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,201 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,201 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:58 [2020-11-29 22:43:20,286 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,286 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-11-29 22:43:20,287 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,310 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,310 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2020-11-29 22:43:20,377 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_50|, |v_#memory_$Pointer$.base_81|], 6=[|v_#memory_int_75|]} [2020-11-29 22:43:20,387 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2020-11-29 22:43:20,388 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,440 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2020-11-29 22:43:20,441 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,515 INFO L625 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2020-11-29 22:43:20,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:20,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:20,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:20,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-29 22:43:20,524 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,577 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,577 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:101, output treesize:64 [2020-11-29 22:43:20,887 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_51|], 6=[|v_#memory_int_76|, |v_#memory_$Pointer$.base_82|]} [2020-11-29 22:43:20,893 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 14 [2020-11-29 22:43:20,894 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:20,941 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2020-11-29 22:43:20,942 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:20,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:20,986 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:21,046 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:21,046 INFO L384 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 135 [2020-11-29 22:43:21,048 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,054 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 22:43:21,055 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,060 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,066 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,072 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,078 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,084 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,088 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-29 22:43:21,089 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,092 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,096 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,100 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,105 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-11-29 22:43:21,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 22:43:21,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:43:21,111 INFO L545 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:21,203 INFO L625 ElimStorePlain]: treesize reduction 70, result has 49.3 percent of original size [2020-11-29 22:43:21,204 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:21,204 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:198, output treesize:94 [2020-11-29 22:43:21,410 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2020-11-29 22:43:21,415 INFO L384 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 22 treesize of output 10 [2020-11-29 22:43:21,415 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:21,443 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:21,447 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:21,454 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:21,454 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 46 [2020-11-29 22:43:21,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:43:21,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:43:21,457 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:21,510 INFO L625 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2020-11-29 22:43:21,512 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-29 22:43:21,512 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:105, output treesize:37 [2020-11-29 22:43:21,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 22:43:21,777 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-29 22:43:21,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2020-11-29 22:43:21,779 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 22:43:21,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 22:43:21,793 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 22:43:21,793 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2020-11-29 22:43:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 22:43:21,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 22:43:21,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2020-11-29 22:43:21,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907587611] [2020-11-29 22:43:21,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-29 22:43:21,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:43:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-29 22:43:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1451, Unknown=3, NotChecked=0, Total=1640 [2020-11-29 22:43:21,824 INFO L87 Difference]: Start difference. First operand 335 states and 393 transitions. Second operand 41 states. [2020-11-29 22:43:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:43:31,521 INFO L93 Difference]: Finished difference Result 436 states and 508 transitions. [2020-11-29 22:43:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-29 22:43:31,522 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 57 [2020-11-29 22:43:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:43:31,524 INFO L225 Difference]: With dead ends: 436 [2020-11-29 22:43:31,524 INFO L226 Difference]: Without dead ends: 436 [2020-11-29 22:43:31,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=400, Invalid=2677, Unknown=3, NotChecked=0, Total=3080 [2020-11-29 22:43:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-11-29 22:43:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 331. [2020-11-29 22:43:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-11-29 22:43:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 387 transitions. [2020-11-29 22:43:31,532 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 387 transitions. Word has length 57 [2020-11-29 22:43:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:43:31,532 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 387 transitions. [2020-11-29 22:43:31,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-29 22:43:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 387 transitions. [2020-11-29 22:43:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-29 22:43:31,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:43:31,534 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:43:31,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-11-29 22:43:31,741 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43ENSURES_VIOLATIONMEMORY_LEAK, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr31ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-29 22:43:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:43:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1927029969, now seen corresponding path program 1 times [2020-11-29 22:43:31,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:43:31,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157791174] [2020-11-29 22:43:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:43:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:43:31,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:43:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:43:31,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:43:31,842 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:43:31,843 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 22:43:31,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 22:43:31,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 10:43:31 BoogieIcfgContainer [2020-11-29 22:43:31,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 22:43:31,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 22:43:31,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 22:43:31,932 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 22:43:31,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:37:45" (3/4) ... [2020-11-29 22:43:31,935 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 22:43:32,018 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eaaf3537-4cc8-4747-b839-69a4446c0126/bin/uautomizer/witness.graphml [2020-11-29 22:43:32,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 22:43:32,019 INFO L168 Benchmark]: Toolchain (without parser) took 347906.86 ms. Allocated memory was 86.0 MB in the beginning and 358.6 MB in the end (delta: 272.6 MB). Free memory was 44.1 MB in the beginning and 237.4 MB in the end (delta: -193.3 MB). Peak memory consumption was 81.4 MB. Max. memory is 16.1 GB. [2020-11-29 22:43:32,019 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 86.0 MB. Free memory is still 61.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:43:32,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.47 ms. Allocated memory is still 86.0 MB. Free memory was 43.8 MB in the beginning and 56.4 MB in the end (delta: -12.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2020-11-29 22:43:32,020 INFO L168 Benchmark]: Boogie Preprocessor took 89.07 ms. Allocated memory is still 86.0 MB. Free memory was 56.4 MB in the beginning and 53.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 22:43:32,020 INFO L168 Benchmark]: RCFGBuilder took 965.70 ms. Allocated memory is still 86.0 MB. Free memory was 53.6 MB in the beginning and 51.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. [2020-11-29 22:43:32,021 INFO L168 Benchmark]: TraceAbstraction took 346221.69 ms. Allocated memory was 86.0 MB in the beginning and 358.6 MB in the end (delta: 272.6 MB). Free memory was 50.8 MB in the beginning and 241.6 MB in the end (delta: -190.7 MB). Peak memory consumption was 82.8 MB. Max. memory is 16.1 GB. [2020-11-29 22:43:32,021 INFO L168 Benchmark]: Witness Printer took 86.46 ms. Allocated memory is still 358.6 MB. Free memory was 240.5 MB in the beginning and 237.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 22:43:32,023 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 86.0 MB. Free memory is still 61.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 538.47 ms. Allocated memory is still 86.0 MB. Free memory was 43.8 MB in the beginning and 56.4 MB in the end (delta: -12.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.07 ms. Allocated memory is still 86.0 MB. Free memory was 56.4 MB in the beginning and 53.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 965.70 ms. Allocated memory is still 86.0 MB. Free memory was 53.6 MB in the beginning and 51.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 346221.69 ms. Allocated memory was 86.0 MB in the beginning and 358.6 MB in the end (delta: 272.6 MB). Free memory was 50.8 MB in the beginning and 241.6 MB in the end (delta: -190.7 MB). Peak memory consumption was 82.8 MB. Max. memory is 16.1 GB. * Witness Printer took 86.46 ms. Allocated memory is still 358.6 MB. Free memory was 240.5 MB in the beginning and 237.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 610]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L567] List p, a, t; [L568] a = (List) malloc(sizeof(struct node)) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L569] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L570] a->n = 0 VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L571] p = a [L572] int i = 0; VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={1:0}, i=0, i < 20 && __VERIFIER_nondet_int()=1, malloc(sizeof(struct node))={1:0}, p={1:0}] [L573] COND TRUE i < 20 && __VERIFIER_nondet_int() [L574] i++ [L575] p->flag = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, p={1:0}] [L576] p->flag VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, p={1:0}, p->flag=-1] [L576] COND TRUE p->flag [L577] p->h = 1 VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, p={1:0}] [L581] t = (List) malloc(sizeof(struct node)) VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L582] COND FALSE !(t == 0) VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L583] p->n = t VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L584] EXPR p->n VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->n={-2:0}, t={-2:0}] [L584] p = p->n [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={1:0}, i=1, i < 20 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L573] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L586] p->h = 3 VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L587] p = a VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L588] EXPR p->h VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->h=1, t={-2:0}] [L588] COND TRUE p->h != 3 [L589] p->flag VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->flag=-1, t={-2:0}] [L589] COND TRUE p->flag [L590] EXPR p->h VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->h=1, t={-2:0}] [L590] COND FALSE !(p->h != 1) [L596] EXPR p->n VAL [a={1:0}, i=1, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->n={-2:0}, t={-2:0}] [L596] p = p->n [L597] i++ VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L588] EXPR p->h VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=3, t={-2:0}] [L588] COND FALSE !(p->h != 3) [L599] EXPR p->h VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=3, t={-2:0}] [L599] COND FALSE !(p->h != 3 || i > 20) [L601] p = a VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L602] COND FALSE !(p == 0) VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L605] EXPR p->n VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->n={-2:0}, t={-2:0}] [L605] COND FALSE !(p->n == 0) [L610] EXPR p->n VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->n={-2:0}, t={-2:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, p->n={-2:0}, t={-2:0}] [L611] t = p->n [L612] free(p) VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L612] free(p) VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={1:0}, t={-2:0}] [L612] free(p) [L613] p = t VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L610] EXPR p->n VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->n={53:58}, t={-2:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->n={53:58}, t={-2:0}] [L611] t = p->n [L612] free(p) VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={53:58}] [L612] free(p) VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={53:58}] [L612] free(p) [L613] p = t VAL [a={1:0}, i=2, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2:0}, p={53:58}, t={53:58}] [L610] p->n - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 121 locations, 45 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 346.0s, OverallIterations: 39, TraceHistogramMax: 3, AutomataDifference: 285.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2810 SDtfs, 15886 SDslu, 24179 SDs, 0 SdLazy, 40238 SolverSat, 2795 SolverUnsat, 129 SolverUnknown, 0 SolverNotchecked, 214.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2177 GetRequests, 906 SyntacticMatches, 38 SemanticMatches, 1233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16289 ImplicationChecksByTransitivity, 99.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 3168 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 50.3s InterpolantComputationTime, 2654 NumberOfCodeBlocks, 2654 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2534 ConstructedInterpolants, 337 QuantifiedInterpolants, 2249698 SizeOfPredicates, 497 NumberOfNonLiveVariables, 6308 ConjunctsInSsa, 1127 ConjunctsInUnsatCore, 63 InterpolantComputations, 13 PerfectInterpolantSequences, 35/589 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...