./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 925bf64e647f08edad293233522d90c39c43645d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 04:26:10,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:10,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:11,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:11,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:11,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:11,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:11,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:11,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:11,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:11,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:11,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:11,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:11,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:11,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:11,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:11,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:11,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:11,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:11,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:11,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:11,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:11,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:11,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:11,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:11,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:11,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:11,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:11,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:11,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:11,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:11,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:11,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:11,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:11,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:11,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:11,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:11,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:11,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:11,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:11,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:11,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:11,154 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:11,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:11,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:11,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:11,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:11,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:11,157 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:11,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:11,157 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:11,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:11,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:11,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:11,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:11,158 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:11,158 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:11,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:11,159 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:11,159 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:11,159 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:11,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:11,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:11,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:11,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:11,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:11,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:11,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:11,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:11,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:11,161 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) 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 -> 925bf64e647f08edad293233522d90c39c43645d [2021-08-27 04:26:11,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:11,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:11,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:11,456 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:11,457 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:11,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2021-08-27 04:26:11,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef72fe3a/144431fbc28f42459d0086d514c5044b/FLAGd395adddf [2021-08-27 04:26:11,829 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:11,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2021-08-27 04:26:11,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef72fe3a/144431fbc28f42459d0086d514c5044b/FLAGd395adddf [2021-08-27 04:26:12,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef72fe3a/144431fbc28f42459d0086d514c5044b [2021-08-27 04:26:12,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:12,246 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:12,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:12,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:12,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68197d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12, skipping insertion in model container [2021-08-27 04:26:12,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:12,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:12,438 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2021-08-27 04:26:12,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,489 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:12,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2021-08-27 04:26:12,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,544 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:12,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12 WrapperNode [2021-08-27 04:26:12,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:12,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:12,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:12,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:12,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:12,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,632 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:12,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:12,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 04:26:12,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 04:26:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 04:26:12,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 04:26:12,693 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-27 04:26:12,693 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-08-27 04:26:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2021-08-27 04:26:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2021-08-27 04:26:12,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:12,694 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 04:26:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-08-27 04:26:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2021-08-27 04:26:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2021-08-27 04:26:12,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:12,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:13,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:13,314 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-27 04:26:13,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13 BoogieIcfgContainer [2021-08-27 04:26:13,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:13,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:13,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:13,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:13,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:12" (1/3) ... [2021-08-27 04:26:13,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c015b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (2/3) ... [2021-08-27 04:26:13,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c015b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/3) ... [2021-08-27 04:26:13,320 INFO L111 eAbstractionObserver]: Analyzing ICFG tree-4.i [2021-08-27 04:26:13,323 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:13,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-08-27 04:26:13,383 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:13,387 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 04:26:13,387 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-08-27 04:26:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 84 states have (on average 2.107142857142857) internal successors, (177), 152 states have internal predecessors, (177), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 04:26:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 04:26:13,407 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:13,408 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:13,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting create_treeErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash -557652933, now seen corresponding path program 1 times [2021-08-27 04:26:13,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:13,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008870125] [2021-08-27 04:26:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:13,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:13,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:13,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008870125] [2021-08-27 04:26:13,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008870125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:13,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:13,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:13,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733303044] [2021-08-27 04:26:13,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 04:26:13,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 04:26:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:13,560 INFO L87 Difference]: Start difference. First operand has 164 states, 84 states have (on average 2.107142857142857) internal successors, (177), 152 states have internal predecessors, (177), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:13,846 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2021-08-27 04:26:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:26:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 04:26:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:13,853 INFO L225 Difference]: With dead ends: 216 [2021-08-27 04:26:13,853 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 04:26:13,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 04:26:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 169. [2021-08-27 04:26:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 91 states have (on average 1.901098901098901) internal successors, (173), 157 states have internal predecessors, (173), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 04:26:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2021-08-27 04:26:13,881 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 10 [2021-08-27 04:26:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:13,881 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2021-08-27 04:26:13,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2021-08-27 04:26:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:13,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:13,882 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:13,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:13,883 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting create_treeErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash -108387509, now seen corresponding path program 1 times [2021-08-27 04:26:13,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:13,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583481509] [2021-08-27 04:26:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:13,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:13,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:13,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583481509] [2021-08-27 04:26:13,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583481509] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:13,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:13,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:13,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647731129] [2021-08-27 04:26:13,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:13,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:13,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:13,950 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,336 INFO L93 Difference]: Finished difference Result 209 states and 227 transitions. [2021-08-27 04:26:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 04:26:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,339 INFO L225 Difference]: With dead ends: 209 [2021-08-27 04:26:14,339 INFO L226 Difference]: Without dead ends: 209 [2021-08-27 04:26:14,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-27 04:26:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2021-08-27 04:26:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 91 states have (on average 1.8571428571428572) internal successors, (169), 157 states have internal predecessors, (169), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 04:26:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2021-08-27 04:26:14,346 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 11 [2021-08-27 04:26:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,347 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2021-08-27 04:26:14,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2021-08-27 04:26:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:14,348 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,348 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:14,348 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting create_treeErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash -108386450, now seen corresponding path program 1 times [2021-08-27 04:26:14,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44672982] [2021-08-27 04:26:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44672982] [2021-08-27 04:26:14,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44672982] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817627402] [2021-08-27 04:26:14,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,406 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,761 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2021-08-27 04:26:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 04:26:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,762 INFO L225 Difference]: With dead ends: 206 [2021-08-27 04:26:14,762 INFO L226 Difference]: Without dead ends: 206 [2021-08-27 04:26:14,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-27 04:26:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 162. [2021-08-27 04:26:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.7634408602150538) internal successors, (164), 150 states have internal predecessors, (164), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 04:26:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2021-08-27 04:26:14,769 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 11 [2021-08-27 04:26:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,769 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2021-08-27 04:26:14,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2021-08-27 04:26:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:14,770 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,770 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:14,770 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting create_treeErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash -108386449, now seen corresponding path program 1 times [2021-08-27 04:26:14,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90187626] [2021-08-27 04:26:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90187626] [2021-08-27 04:26:14,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90187626] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563060029] [2021-08-27 04:26:14,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,828 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,193 INFO L93 Difference]: Finished difference Result 225 states and 244 transitions. [2021-08-27 04:26:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-27 04:26:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,195 INFO L225 Difference]: With dead ends: 225 [2021-08-27 04:26:15,195 INFO L226 Difference]: Without dead ends: 225 [2021-08-27 04:26:15,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-27 04:26:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 173. [2021-08-27 04:26:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 108 states have (on average 1.6851851851851851) internal successors, (182), 161 states have internal predecessors, (182), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 04:26:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 195 transitions. [2021-08-27 04:26:15,202 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 195 transitions. Word has length 11 [2021-08-27 04:26:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,202 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 195 transitions. [2021-08-27 04:26:15,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2021-08-27 04:26:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 04:26:15,203 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:15,203 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting create_treeErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash 874689698, now seen corresponding path program 1 times [2021-08-27 04:26:15,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654257736] [2021-08-27 04:26:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654257736] [2021-08-27 04:26:15,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654257736] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:15,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052247473] [2021-08-27 04:26:15,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:15,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:15,259 INFO L87 Difference]: Start difference. First operand 173 states and 195 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,590 INFO L93 Difference]: Finished difference Result 220 states and 247 transitions. [2021-08-27 04:26:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-08-27 04:26:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,591 INFO L225 Difference]: With dead ends: 220 [2021-08-27 04:26:15,591 INFO L226 Difference]: Without dead ends: 220 [2021-08-27 04:26:15,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-27 04:26:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 177. [2021-08-27 04:26:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 112 states have (on average 1.6607142857142858) internal successors, (186), 165 states have internal predecessors, (186), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-08-27 04:26:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 199 transitions. [2021-08-27 04:26:15,596 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 199 transitions. Word has length 14 [2021-08-27 04:26:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,596 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 199 transitions. [2021-08-27 04:26:15,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 199 transitions. [2021-08-27 04:26:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:15,597 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,597 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:15,597 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -388091640, now seen corresponding path program 1 times [2021-08-27 04:26:15,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621553095] [2021-08-27 04:26:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:26:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621553095] [2021-08-27 04:26:15,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621553095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:15,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086184481] [2021-08-27 04:26:15,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:15,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,728 INFO L87 Difference]: Start difference. First operand 177 states and 199 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,383 INFO L93 Difference]: Finished difference Result 220 states and 243 transitions. [2021-08-27 04:26:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:16,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-08-27 04:26:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,385 INFO L225 Difference]: With dead ends: 220 [2021-08-27 04:26:16,385 INFO L226 Difference]: Without dead ends: 213 [2021-08-27 04:26:16,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 239.0ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-27 04:26:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 170. [2021-08-27 04:26:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 159 states have internal predecessors, (179), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2021-08-27 04:26:16,389 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 21 [2021-08-27 04:26:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,389 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2021-08-27 04:26:16,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2021-08-27 04:26:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:16,390 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,390 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:16,390 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_treeErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 53276323, now seen corresponding path program 1 times [2021-08-27 04:26:16,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913051908] [2021-08-27 04:26:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913051908] [2021-08-27 04:26:16,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913051908] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:16,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011086711] [2021-08-27 04:26:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:16,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:16,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 04:26:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 04:26:16,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:16,719 INFO L388 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 [2021-08-27 04:26:16,789 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 04:26:16,789 INFO L388 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 21 [2021-08-27 04:26:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011086711] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:16,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:16,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-08-27 04:26:16,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081773128] [2021-08-27 04:26:16,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:16,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:16,898 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,411 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2021-08-27 04:26:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 04:26:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,413 INFO L225 Difference]: With dead ends: 222 [2021-08-27 04:26:17,413 INFO L226 Difference]: Without dead ends: 222 [2021-08-27 04:26:17,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-08-27 04:26:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2021-08-27 04:26:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 106 states have (on average 1.679245283018868) internal successors, (178), 158 states have internal predecessors, (178), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2021-08-27 04:26:17,417 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 23 [2021-08-27 04:26:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,417 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2021-08-27 04:26:17,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2021-08-27 04:26:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:17,418 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,418 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:17,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:17,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:17,636 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_treeErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 53276324, now seen corresponding path program 1 times [2021-08-27 04:26:17,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525136446] [2021-08-27 04:26:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:17,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525136446] [2021-08-27 04:26:17,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525136446] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:17,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501040378] [2021-08-27 04:26:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:17,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:17,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:17,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 04:26:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 04:26:17,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:17,965 INFO L388 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 [2021-08-27 04:26:17,972 INFO L388 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 [2021-08-27 04:26:18,128 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 04:26:18,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-08-27 04:26:18,137 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:18,137 INFO L388 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 21 treesize of output 21 [2021-08-27 04:26:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:18,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501040378] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:18,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:18,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-27 04:26:18,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498923566] [2021-08-27 04:26:18,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:18,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:18,244 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:18,789 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2021-08-27 04:26:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:18,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 04:26:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:18,790 INFO L225 Difference]: With dead ends: 230 [2021-08-27 04:26:18,791 INFO L226 Difference]: Without dead ends: 230 [2021-08-27 04:26:18,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-27 04:26:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 168. [2021-08-27 04:26:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.669811320754717) internal successors, (177), 157 states have internal predecessors, (177), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 189 transitions. [2021-08-27 04:26:18,794 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 189 transitions. Word has length 23 [2021-08-27 04:26:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:18,794 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 189 transitions. [2021-08-27 04:26:18,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 189 transitions. [2021-08-27 04:26:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:18,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,795 INFO L512 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] [2021-08-27 04:26:18,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:19,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-08-27 04:26:19,014 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_treeErr14REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash -190246733, now seen corresponding path program 1 times [2021-08-27 04:26:19,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932798965] [2021-08-27 04:26:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:19,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932798965] [2021-08-27 04:26:19,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932798965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:19,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282701868] [2021-08-27 04:26:19,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:19,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:19,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:19,088 INFO L87 Difference]: Start difference. First operand 168 states and 189 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,501 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2021-08-27 04:26:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 04:26:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,502 INFO L225 Difference]: With dead ends: 205 [2021-08-27 04:26:19,502 INFO L226 Difference]: Without dead ends: 205 [2021-08-27 04:26:19,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 43.9ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-08-27 04:26:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 167. [2021-08-27 04:26:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.650943396226415) internal successors, (175), 156 states have internal predecessors, (175), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2021-08-27 04:26:19,505 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 26 [2021-08-27 04:26:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,506 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2021-08-27 04:26:19,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2021-08-27 04:26:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:19,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,507 INFO L512 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] [2021-08-27 04:26:19,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:19,507 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_treeErr15REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:19,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash -190246732, now seen corresponding path program 1 times [2021-08-27 04:26:19,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289179702] [2021-08-27 04:26:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 04:26:19,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289179702] [2021-08-27 04:26:19,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289179702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:19,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854591016] [2021-08-27 04:26:19,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:19,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:19,585 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,030 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2021-08-27 04:26:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:20,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 04:26:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,031 INFO L225 Difference]: With dead ends: 204 [2021-08-27 04:26:20,032 INFO L226 Difference]: Without dead ends: 204 [2021-08-27 04:26:20,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-08-27 04:26:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2021-08-27 04:26:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 106 states have (on average 1.6320754716981132) internal successors, (173), 155 states have internal predecessors, (173), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 185 transitions. [2021-08-27 04:26:20,035 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 185 transitions. Word has length 26 [2021-08-27 04:26:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,035 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 185 transitions. [2021-08-27 04:26:20,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 185 transitions. [2021-08-27 04:26:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:20,036 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,036 INFO L512 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] [2021-08-27 04:26:20,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:20,036 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1822618347, now seen corresponding path program 1 times [2021-08-27 04:26:20,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377097179] [2021-08-27 04:26:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:26:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:20,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377097179] [2021-08-27 04:26:20,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377097179] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:20,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129630210] [2021-08-27 04:26:20,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:20,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:20,100 INFO L87 Difference]: Start difference. First operand 166 states and 185 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,465 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2021-08-27 04:26:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:20,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-08-27 04:26:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,467 INFO L225 Difference]: With dead ends: 210 [2021-08-27 04:26:20,467 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 04:26:20,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 04:26:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2021-08-27 04:26:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.619047619047619) internal successors, (170), 154 states have internal predecessors, (170), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2021-08-27 04:26:20,470 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 26 [2021-08-27 04:26:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,470 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2021-08-27 04:26:20,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2021-08-27 04:26:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 04:26:20,471 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,471 INFO L512 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] [2021-08-27 04:26:20,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:20,471 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_treeErr18REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1716475476, now seen corresponding path program 1 times [2021-08-27 04:26:20,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659374031] [2021-08-27 04:26:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:20,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659374031] [2021-08-27 04:26:20,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659374031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:20,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713354475] [2021-08-27 04:26:20,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:20,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:20,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:20,580 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,188 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2021-08-27 04:26:21,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:21,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 04:26:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,190 INFO L225 Difference]: With dead ends: 204 [2021-08-27 04:26:21,190 INFO L226 Difference]: Without dead ends: 204 [2021-08-27 04:26:21,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 130.1ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-08-27 04:26:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2021-08-27 04:26:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 154 states have internal predecessors, (169), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 181 transitions. [2021-08-27 04:26:21,193 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 181 transitions. Word has length 29 [2021-08-27 04:26:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,193 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 181 transitions. [2021-08-27 04:26:21,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 181 transitions. [2021-08-27 04:26:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 04:26:21,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,194 INFO L512 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] [2021-08-27 04:26:21,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:21,194 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_treeErr19REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1716475477, now seen corresponding path program 1 times [2021-08-27 04:26:21,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622539522] [2021-08-27 04:26:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622539522] [2021-08-27 04:26:21,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622539522] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:21,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837189277] [2021-08-27 04:26:21,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:21,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:21,326 INFO L87 Difference]: Start difference. First operand 165 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,899 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2021-08-27 04:26:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:21,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 04:26:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,901 INFO L225 Difference]: With dead ends: 203 [2021-08-27 04:26:21,901 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 04:26:21,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 159.6ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 04:26:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2021-08-27 04:26:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.6) internal successors, (168), 154 states have internal predecessors, (168), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions. [2021-08-27 04:26:21,904 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 29 [2021-08-27 04:26:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,904 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions. [2021-08-27 04:26:21,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions. [2021-08-27 04:26:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:26:21,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,905 INFO L512 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] [2021-08-27 04:26:21,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 04:26:21,905 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_treeErr22REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -359646150, now seen corresponding path program 1 times [2021-08-27 04:26:21,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755274007] [2021-08-27 04:26:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755274007] [2021-08-27 04:26:22,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755274007] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:22,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043272301] [2021-08-27 04:26:22,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:22,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:22,034 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,777 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2021-08-27 04:26:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 04:26:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,779 INFO L225 Difference]: With dead ends: 204 [2021-08-27 04:26:22,779 INFO L226 Difference]: Without dead ends: 204 [2021-08-27 04:26:22,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 146.3ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-08-27 04:26:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2021-08-27 04:26:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 154 states have internal predecessors, (167), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2021-08-27 04:26:22,782 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 32 [2021-08-27 04:26:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,782 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2021-08-27 04:26:22,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2021-08-27 04:26:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:26:22,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,783 INFO L512 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] [2021-08-27 04:26:22,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 04:26:22,783 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_treeErr23REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash -359646149, now seen corresponding path program 1 times [2021-08-27 04:26:22,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379985922] [2021-08-27 04:26:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379985922] [2021-08-27 04:26:22,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379985922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:22,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981967750] [2021-08-27 04:26:22,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:22,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:22,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:22,953 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:23,611 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2021-08-27 04:26:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 04:26:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:23,613 INFO L225 Difference]: With dead ends: 203 [2021-08-27 04:26:23,613 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 04:26:23,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 185.7ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 04:26:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2021-08-27 04:26:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.5809523809523809) internal successors, (166), 154 states have internal predecessors, (166), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2021-08-27 04:26:23,616 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 32 [2021-08-27 04:26:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:23,616 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2021-08-27 04:26:23,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2021-08-27 04:26:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 04:26:23,617 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,617 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:23,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:23,617 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_treeErr26REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1725030331, now seen corresponding path program 1 times [2021-08-27 04:26:23,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012438312] [2021-08-27 04:26:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012438312] [2021-08-27 04:26:23,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012438312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:23,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289011816] [2021-08-27 04:26:23,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:23,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:23,774 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,377 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2021-08-27 04:26:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 04:26:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 04:26:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,379 INFO L225 Difference]: With dead ends: 205 [2021-08-27 04:26:24,379 INFO L226 Difference]: Without dead ends: 205 [2021-08-27 04:26:24,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 193.7ms TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2021-08-27 04:26:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-08-27 04:26:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 165. [2021-08-27 04:26:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 154 states have internal predecessors, (165), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2021-08-27 04:26:24,382 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 35 [2021-08-27 04:26:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,382 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2021-08-27 04:26:24,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2021-08-27 04:26:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 04:26:24,383 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,383 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:26:24,383 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_treeErr27REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1725030332, now seen corresponding path program 1 times [2021-08-27 04:26:24,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093079074] [2021-08-27 04:26:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:24,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093079074] [2021-08-27 04:26:24,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093079074] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:24,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360787353] [2021-08-27 04:26:24,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:24,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:24,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:24,581 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,263 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2021-08-27 04:26:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:25,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 04:26:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,264 INFO L225 Difference]: With dead ends: 203 [2021-08-27 04:26:25,264 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 04:26:25,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 213.0ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-08-27 04:26:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 04:26:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2021-08-27 04:26:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.561904761904762) internal successors, (164), 154 states have internal predecessors, (164), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2021-08-27 04:26:25,267 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 35 [2021-08-27 04:26:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,268 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2021-08-27 04:26:25,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2021-08-27 04:26:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 04:26:25,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,269 INFO L512 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] [2021-08-27 04:26:25,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 04:26:25,269 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting create_treeErr10REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash 11285986, now seen corresponding path program 1 times [2021-08-27 04:26:25,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827483981] [2021-08-27 04:26:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:25,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827483981] [2021-08-27 04:26:25,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827483981] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:25,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917506741] [2021-08-27 04:26:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,601 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:25,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:25,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 04:26:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-27 04:26:25,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:25,879 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-08-27 04:26:25,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 24 [2021-08-27 04:26:26,058 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-08-27 04:26:26,058 INFO L388 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 3 case distinctions, treesize of input 17 treesize of output 30 [2021-08-27 04:26:26,192 INFO L388 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 [2021-08-27 04:26:26,201 INFO L388 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 [2021-08-27 04:26:26,339 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 04:26:26,339 INFO L388 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 29 treesize of output 13 [2021-08-27 04:26:26,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:26,350 INFO L388 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 29 treesize of output 13 [2021-08-27 04:26:26,525 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 04:26:26,525 INFO L388 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 23 treesize of output 22 [2021-08-27 04:26:26,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:26,538 INFO L388 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 22 [2021-08-27 04:26:26,642 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-08-27 04:26:26,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 49 [2021-08-27 04:26:26,771 INFO L354 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2021-08-27 04:26:26,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 54 [2021-08-27 04:26:26,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:26,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:26,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:26,796 INFO L388 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 30 treesize of output 32 [2021-08-27 04:26:27,162 INFO L354 Elim1Store]: treesize reduction 116, result has 18.3 percent of original size [2021-08-27 04:26:27,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 93 [2021-08-27 04:26:27,185 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 04:26:27,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 99 [2021-08-27 04:26:27,581 INFO L354 Elim1Store]: treesize reduction 188, result has 14.9 percent of original size [2021-08-27 04:26:27,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 114 [2021-08-27 04:26:27,618 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-08-27 04:26:27,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 128 [2021-08-27 04:26:32,109 INFO L354 Elim1Store]: treesize reduction 218, result has 15.8 percent of original size [2021-08-27 04:26:32,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 159 treesize of output 136 [2021-08-27 04:26:32,147 INFO L354 Elim1Store]: treesize reduction 190, result has 16.7 percent of original size [2021-08-27 04:26:32,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 118 [2021-08-27 04:26:32,421 INFO L354 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2021-08-27 04:26:32,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 111 [2021-08-27 04:26:32,445 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 04:26:32,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 117 [2021-08-27 04:26:32,468 INFO L354 Elim1Store]: treesize reduction 44, result has 27.9 percent of original size [2021-08-27 04:26:32,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 115 [2021-08-27 04:26:32,616 INFO L354 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2021-08-27 04:26:32,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 60 [2021-08-27 04:26:32,622 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-08-27 04:26:32,623 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 31 [2021-08-27 04:26:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:32,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917506741] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:32,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:32,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2021-08-27 04:26:32,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039801327] [2021-08-27 04:26:32,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-27 04:26:32,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:32,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-27 04:26:32,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=679, Unknown=2, NotChecked=0, Total=812 [2021-08-27 04:26:32,642 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:53,140 INFO L93 Difference]: Finished difference Result 234 states and 248 transitions. [2021-08-27 04:26:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 04:26:53,141 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-08-27 04:26:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:53,142 INFO L225 Difference]: With dead ends: 234 [2021-08-27 04:26:53,142 INFO L226 Difference]: Without dead ends: 234 [2021-08-27 04:26:53,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 20003.8ms TimeCoverageRelationStatistics Valid=403, Invalid=2138, Unknown=9, NotChecked=0, Total=2550 [2021-08-27 04:26:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-08-27 04:26:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 191. [2021-08-27 04:26:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 180 states have internal predecessors, (191), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2021-08-27 04:26:53,145 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 40 [2021-08-27 04:26:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:53,146 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2021-08-27 04:26:53,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2021-08-27 04:26:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 04:26:53,146 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:53,147 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:53,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:53,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-27 04:26:53,364 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1714624533, now seen corresponding path program 1 times [2021-08-27 04:26:53,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:53,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085624306] [2021-08-27 04:26:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:26:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 04:26:53,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:53,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085624306] [2021-08-27 04:26:53,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085624306] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:53,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:53,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:53,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049328565] [2021-08-27 04:26:53,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:53,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:53,495 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:54,100 INFO L93 Difference]: Finished difference Result 230 states and 243 transitions. [2021-08-27 04:26:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-08-27 04:26:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:54,101 INFO L225 Difference]: With dead ends: 230 [2021-08-27 04:26:54,101 INFO L226 Difference]: Without dead ends: 230 [2021-08-27 04:26:54,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 99.7ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-27 04:26:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2021-08-27 04:26:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 131 states have (on average 1.4427480916030535) internal successors, (189), 180 states have internal predecessors, (189), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 201 transitions. [2021-08-27 04:26:54,105 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 201 transitions. Word has length 45 [2021-08-27 04:26:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:54,105 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 201 transitions. [2021-08-27 04:26:54,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 201 transitions. [2021-08-27 04:26:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 04:26:54,106 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:54,106 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:54,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 04:26:54,106 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2037935847, now seen corresponding path program 1 times [2021-08-27 04:26:54,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:54,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039031746] [2021-08-27 04:26:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:54,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:26:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 04:26:54,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:54,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039031746] [2021-08-27 04:26:54,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039031746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:54,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:54,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 04:26:54,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643121904] [2021-08-27 04:26:54,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:54,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:54,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:54,250 INFO L87 Difference]: Start difference. First operand 191 states and 201 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:55,035 INFO L93 Difference]: Finished difference Result 253 states and 268 transitions. [2021-08-27 04:26:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2021-08-27 04:26:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:55,037 INFO L225 Difference]: With dead ends: 253 [2021-08-27 04:26:55,037 INFO L226 Difference]: Without dead ends: 253 [2021-08-27 04:26:55,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-08-27 04:26:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-27 04:26:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 191. [2021-08-27 04:26:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 180 states have internal predecessors, (189), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 200 transitions. [2021-08-27 04:26:55,040 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 200 transitions. Word has length 49 [2021-08-27 04:26:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:55,040 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 200 transitions. [2021-08-27 04:26:55,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 200 transitions. [2021-08-27 04:26:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 04:26:55,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:55,041 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:55,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 04:26:55,042 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting inspectErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1248564646, now seen corresponding path program 1 times [2021-08-27 04:26:55,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:55,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061847066] [2021-08-27 04:26:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:55,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:26:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:55,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:55,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061847066] [2021-08-27 04:26:55,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061847066] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:55,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741239452] [2021-08-27 04:26:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:55,194 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:55,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:55,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:55,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 04:26:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 04:26:55,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:55,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741239452] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:55,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:55,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2021-08-27 04:26:55,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227260585] [2021-08-27 04:26:55,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:26:55,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:26:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:55,816 INFO L87 Difference]: Start difference. First operand 191 states and 200 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:56,605 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2021-08-27 04:26:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2021-08-27 04:26:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:56,607 INFO L225 Difference]: With dead ends: 229 [2021-08-27 04:26:56,607 INFO L226 Difference]: Without dead ends: 229 [2021-08-27 04:26:56,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 220.9ms TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-08-27 04:26:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 189. [2021-08-27 04:26:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 133 states have (on average 1.413533834586466) internal successors, (188), 178 states have internal predecessors, (188), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2021-08-27 04:26:56,610 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 50 [2021-08-27 04:26:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:56,610 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2021-08-27 04:26:56,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2021-08-27 04:26:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 04:26:56,611 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:56,611 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:56,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:56,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:56,828 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting inspectErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1248564645, now seen corresponding path program 1 times [2021-08-27 04:26:56,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:56,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983927885] [2021-08-27 04:26:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:56,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:26:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:57,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:57,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983927885] [2021-08-27 04:26:57,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983927885] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:57,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328364179] [2021-08-27 04:26:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:57,073 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:57,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:57,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:57,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 04:26:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:57,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 04:26:57,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:58,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328364179] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:58,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:58,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-08-27 04:26:58,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213034453] [2021-08-27 04:26:58,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 04:26:58,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 04:26:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-08-27 04:26:58,118 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:26:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:59,303 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2021-08-27 04:26:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 04:26:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2021-08-27 04:26:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:59,305 INFO L225 Difference]: With dead ends: 244 [2021-08-27 04:26:59,305 INFO L226 Difference]: Without dead ends: 244 [2021-08-27 04:26:59,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 485.6ms TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-08-27 04:26:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-08-27 04:26:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 191. [2021-08-27 04:26:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 180 states have internal predecessors, (190), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:26:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 201 transitions. [2021-08-27 04:26:59,308 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 201 transitions. Word has length 50 [2021-08-27 04:26:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:59,308 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 201 transitions. [2021-08-27 04:26:59,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:26:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 201 transitions. [2021-08-27 04:26:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 04:26:59,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:59,309 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:59,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:59,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-27 04:26:59,527 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting create_treeErr10REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:26:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1489839671, now seen corresponding path program 1 times [2021-08-27 04:26:59,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:59,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110407617] [2021-08-27 04:26:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:59,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:59,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:59,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110407617] [2021-08-27 04:26:59,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110407617] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:59,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555708724] [2021-08-27 04:26:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:59,867 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:59,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:59,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 04:27:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:00,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-27 04:27:00,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:00,427 INFO L388 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 [2021-08-27 04:27:00,564 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 04:27:00,564 INFO L388 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 21 [2021-08-27 04:27:00,649 INFO L388 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 [2021-08-27 04:27:00,656 INFO L388 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 [2021-08-27 04:27:00,744 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 04:27:00,745 INFO L388 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 77 treesize of output 49 [2021-08-27 04:27:00,757 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 04:27:00,757 INFO L388 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 67 treesize of output 60 [2021-08-27 04:27:00,865 INFO L354 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2021-08-27 04:27:00,866 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 67 [2021-08-27 04:27:00,888 INFO L354 Elim1Store]: treesize reduction 104, result has 18.1 percent of original size [2021-08-27 04:27:00,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2021-08-27 04:27:01,052 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 04:27:01,053 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 70 [2021-08-27 04:27:01,074 INFO L354 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2021-08-27 04:27:01,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2021-08-27 04:27:01,184 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-08-27 04:27:01,184 INFO L388 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 45 [2021-08-27 04:27:01,320 INFO L354 Elim1Store]: treesize reduction 138, result has 18.8 percent of original size [2021-08-27 04:27:01,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 121 [2021-08-27 04:27:01,355 INFO L354 Elim1Store]: treesize reduction 108, result has 19.4 percent of original size [2021-08-27 04:27:01,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 89 [2021-08-27 04:27:01,728 INFO L354 Elim1Store]: treesize reduction 180, result has 15.5 percent of original size [2021-08-27 04:27:01,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 110 [2021-08-27 04:27:01,766 INFO L354 Elim1Store]: treesize reduction 178, result has 15.2 percent of original size [2021-08-27 04:27:01,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 137 [2021-08-27 04:27:02,172 INFO L354 Elim1Store]: treesize reduction 268, result has 13.0 percent of original size [2021-08-27 04:27:02,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 170 treesize of output 131 [2021-08-27 04:27:02,228 INFO L354 Elim1Store]: treesize reduction 272, result has 13.7 percent of original size [2021-08-27 04:27:02,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 162 treesize of output 166 [2021-08-27 04:27:06,711 INFO L354 Elim1Store]: treesize reduction 306, result has 13.6 percent of original size [2021-08-27 04:27:06,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 194 treesize of output 153 [2021-08-27 04:27:06,768 INFO L354 Elim1Store]: treesize reduction 318, result has 13.8 percent of original size [2021-08-27 04:27:06,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 169 treesize of output 156 [2021-08-27 04:27:07,042 INFO L354 Elim1Store]: treesize reduction 196, result has 14.4 percent of original size [2021-08-27 04:27:07,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 148 treesize of output 114 [2021-08-27 04:27:07,081 INFO L354 Elim1Store]: treesize reduction 190, result has 14.4 percent of original size [2021-08-27 04:27:07,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 141 [2021-08-27 04:27:07,299 INFO L354 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2021-08-27 04:27:07,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 89 [2021-08-27 04:27:07,309 INFO L354 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2021-08-27 04:27:07,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 50 [2021-08-27 04:27:07,512 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-08-27 04:27:07,513 INFO L388 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 6 case distinctions, treesize of input 34 treesize of output 42 [2021-08-27 04:27:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:27:09,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555708724] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:09,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:27:09,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2021-08-27 04:27:09,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616376179] [2021-08-27 04:27:09,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-27 04:27:09,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:27:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-27 04:27:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1009, Unknown=2, NotChecked=0, Total=1190 [2021-08-27 04:27:09,630 INFO L87 Difference]: Start difference. First operand 191 states and 201 transitions. Second operand has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:27:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:30,014 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2021-08-27 04:27:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-27 04:27:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-08-27 04:27:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:30,016 INFO L225 Difference]: With dead ends: 276 [2021-08-27 04:27:30,016 INFO L226 Difference]: Without dead ends: 276 [2021-08-27 04:27:30,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 21618.9ms TimeCoverageRelationStatistics Valid=784, Invalid=3367, Unknown=9, NotChecked=0, Total=4160 [2021-08-27 04:27:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-08-27 04:27:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 194. [2021-08-27 04:27:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 138 states have (on average 1.4130434782608696) internal successors, (195), 183 states have internal predecessors, (195), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:27:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2021-08-27 04:27:30,020 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 50 [2021-08-27 04:27:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:30,020 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2021-08-27 04:27:30,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:27:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2021-08-27 04:27:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 04:27:30,021 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:30,021 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:27:30,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 04:27:30,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:27:30,239 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting create_treeErr11REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:27:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1489839672, now seen corresponding path program 1 times [2021-08-27 04:27:30,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:27:30,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159127551] [2021-08-27 04:27:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:30,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:27:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:27:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:27:30,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:27:30,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159127551] [2021-08-27 04:27:30,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159127551] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:30,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162264664] [2021-08-27 04:27:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:30,790 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:27:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:27:30,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:27:30,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 04:27:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 57 conjunts are in the unsatisfiable core [2021-08-27 04:27:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:31,610 INFO L388 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 [2021-08-27 04:27:31,616 INFO L388 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 [2021-08-27 04:27:31,764 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 04:27:31,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 04:27:31,788 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 04:27:31,788 INFO L388 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 21 [2021-08-27 04:27:31,917 INFO L388 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 [2021-08-27 04:27:31,951 INFO L388 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 [2021-08-27 04:27:32,081 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-08-27 04:27:32,082 INFO L388 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 104 treesize of output 70 [2021-08-27 04:27:32,096 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 04:27:32,096 INFO L388 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 94 treesize of output 78 [2021-08-27 04:27:32,235 INFO L354 Elim1Store]: treesize reduction 112, result has 18.2 percent of original size [2021-08-27 04:27:32,236 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 88 [2021-08-27 04:27:32,259 INFO L354 Elim1Store]: treesize reduction 104, result has 18.1 percent of original size [2021-08-27 04:27:32,259 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 81 [2021-08-27 04:27:32,473 INFO L354 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2021-08-27 04:27:32,473 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 91 [2021-08-27 04:27:32,497 INFO L354 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2021-08-27 04:27:32,498 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 99 [2021-08-27 04:27:32,642 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-08-27 04:27:32,642 INFO L388 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 45 [2021-08-27 04:27:32,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2021-08-27 04:27:32,800 INFO L354 Elim1Store]: treesize reduction 148, result has 18.7 percent of original size [2021-08-27 04:27:32,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 126 [2021-08-27 04:27:32,833 INFO L354 Elim1Store]: treesize reduction 138, result has 18.8 percent of original size [2021-08-27 04:27:32,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 149 [2021-08-27 04:27:33,303 INFO L354 Elim1Store]: treesize reduction 180, result has 15.5 percent of original size [2021-08-27 04:27:33,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 120 [2021-08-27 04:27:33,345 INFO L354 Elim1Store]: treesize reduction 178, result has 15.2 percent of original size [2021-08-27 04:27:33,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 157 [2021-08-27 04:27:33,849 INFO L354 Elim1Store]: treesize reduction 268, result has 13.0 percent of original size [2021-08-27 04:27:33,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 141 [2021-08-27 04:27:33,903 INFO L354 Elim1Store]: treesize reduction 272, result has 13.7 percent of original size [2021-08-27 04:27:33,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 186 [2021-08-27 04:27:37,058 INFO L354 Elim1Store]: treesize reduction 306, result has 13.6 percent of original size [2021-08-27 04:27:37,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 214 treesize of output 163 [2021-08-27 04:27:37,127 INFO L354 Elim1Store]: treesize reduction 318, result has 13.8 percent of original size [2021-08-27 04:27:37,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 189 treesize of output 176 [2021-08-27 04:27:37,451 INFO L354 Elim1Store]: treesize reduction 196, result has 14.4 percent of original size [2021-08-27 04:27:37,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 168 treesize of output 124 [2021-08-27 04:27:37,490 INFO L354 Elim1Store]: treesize reduction 190, result has 14.4 percent of original size [2021-08-27 04:27:37,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 161 [2021-08-27 04:27:37,761 INFO L354 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2021-08-27 04:27:37,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 180 treesize of output 104 [2021-08-27 04:27:37,772 INFO L354 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2021-08-27 04:27:37,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 65 [2021-08-27 04:27:38,039 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-08-27 04:27:38,040 INFO L388 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 6 case distinctions, treesize of input 54 treesize of output 62 [2021-08-27 04:27:38,086 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-08-27 04:27:38,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 57 [2021-08-27 04:27:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:27:38,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162264664] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:38,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:27:38,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2021-08-27 04:27:38,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122060269] [2021-08-27 04:27:38,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-08-27 04:27:38,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:27:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-27 04:27:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1025, Unknown=2, NotChecked=0, Total=1190 [2021-08-27 04:27:38,203 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:27:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:46,978 INFO L93 Difference]: Finished difference Result 300 states and 316 transitions. [2021-08-27 04:27:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-27 04:27:46,978 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-08-27 04:27:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:46,979 INFO L225 Difference]: With dead ends: 300 [2021-08-27 04:27:46,979 INFO L226 Difference]: Without dead ends: 300 [2021-08-27 04:27:46,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 10679.6ms TimeCoverageRelationStatistics Valid=1132, Invalid=5186, Unknown=2, NotChecked=0, Total=6320 [2021-08-27 04:27:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-08-27 04:27:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 209. [2021-08-27 04:27:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 198 states have internal predecessors, (215), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-27 04:27:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2021-08-27 04:27:46,984 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 50 [2021-08-27 04:27:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:46,984 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2021-08-27 04:27:46,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:27:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2021-08-27 04:27:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 04:27:46,985 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:46,985 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:27:47,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-08-27 04:27:47,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:27:47,201 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting inspectErr7REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:27:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1574744257, now seen corresponding path program 1 times [2021-08-27 04:27:47,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:27:47,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752786190] [2021-08-27 04:27:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:47,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:27:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:27:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:27:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:27:47,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:27:47,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752786190] [2021-08-27 04:27:47,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752786190] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:47,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108567911] [2021-08-27 04:27:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:47,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:27:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:27:47,514 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:27:47,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 04:27:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:48,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-27 04:27:48,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:48,516 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-08-27 04:27:48,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 24 [2021-08-27 04:27:49,307 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:27:49,307 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2021-08-27 04:27:49,607 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-08-27 04:27:49,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 72 [2021-08-27 04:27:49,927 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 04:27:49,927 INFO L388 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 39 treesize of output 27 [2021-08-27 04:27:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:27:49,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108567911] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:49,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:27:49,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2021-08-27 04:27:49,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460230409] [2021-08-27 04:27:49,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-27 04:27:49,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:27:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 04:27:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2021-08-27 04:27:49,964 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 22 states have internal predecessors, (92), 4 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 04:27:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:53,525 INFO L93 Difference]: Finished difference Result 311 states and 339 transitions. [2021-08-27 04:27:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 04:27:53,526 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 22 states have internal predecessors, (92), 4 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2021-08-27 04:27:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:53,527 INFO L225 Difference]: With dead ends: 311 [2021-08-27 04:27:53,527 INFO L226 Difference]: Without dead ends: 311 [2021-08-27 04:27:53,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2076.9ms TimeCoverageRelationStatistics Valid=314, Invalid=2548, Unknown=0, NotChecked=0, Total=2862 [2021-08-27 04:27:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-27 04:27:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 250. [2021-08-27 04:27:53,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 191 states have (on average 1.4240837696335078) internal successors, (272), 237 states have internal predecessors, (272), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-27 04:27:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2021-08-27 04:27:53,531 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 52 [2021-08-27 04:27:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:53,532 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2021-08-27 04:27:53,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 22 states have internal predecessors, (92), 4 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 04:27:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2021-08-27 04:27:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 04:27:53,532 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:53,533 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:27:53,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 04:27:53,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-08-27 04:27:53,751 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting inspectErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:27:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1572456405, now seen corresponding path program 1 times [2021-08-27 04:27:53,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:27:53,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805444763] [2021-08-27 04:27:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:53,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:27:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:27:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:27:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:27:54,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:27:54,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805444763] [2021-08-27 04:27:54,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805444763] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:54,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390684993] [2021-08-27 04:27:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:54,218 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:27:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:27:54,219 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:27:54,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 04:27:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:55,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-27 04:27:55,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:55,350 INFO L388 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 [2021-08-27 04:27:55,566 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:27:55,566 INFO L388 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 11 [2021-08-27 04:27:55,610 INFO L388 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 16 treesize of output 12 [2021-08-27 04:27:55,757 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:27:55,757 INFO L388 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 28 treesize of output 22 [2021-08-27 04:27:55,930 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 04:27:55,930 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 34 [2021-08-27 04:28:02,146 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 04:28:02,147 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 53 [2021-08-27 04:28:02,305 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:28:02,305 INFO L388 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 39 treesize of output 29 [2021-08-27 04:28:02,967 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 04:28:02,968 INFO L388 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 44 treesize of output 28 [2021-08-27 04:28:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:28:02,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390684993] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:28:02,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:28:02,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2021-08-27 04:28:02,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615938808] [2021-08-27 04:28:02,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-27 04:28:02,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:28:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 04:28:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1301, Unknown=2, NotChecked=0, Total=1406 [2021-08-27 04:28:02,974 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 32 states have internal predecessors, (91), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:28:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:27,237 INFO L93 Difference]: Finished difference Result 337 states and 383 transitions. [2021-08-27 04:28:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 04:28:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 32 states have internal predecessors, (91), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2021-08-27 04:28:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:27,238 INFO L225 Difference]: With dead ends: 337 [2021-08-27 04:28:27,238 INFO L226 Difference]: Without dead ends: 337 [2021-08-27 04:28:27,239 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 24431.6ms TimeCoverageRelationStatistics Valid=413, Invalid=3610, Unknown=9, NotChecked=0, Total=4032 [2021-08-27 04:28:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-27 04:28:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 284. [2021-08-27 04:28:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 222 states have (on average 1.427927927927928) internal successors, (317), 269 states have internal predecessors, (317), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 04:28:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 334 transitions. [2021-08-27 04:28:27,245 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 334 transitions. Word has length 53 [2021-08-27 04:28:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:27,246 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 334 transitions. [2021-08-27 04:28:27,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 32 states have internal predecessors, (91), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:28:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 334 transitions. [2021-08-27 04:28:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 04:28:27,261 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:27,261 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:28:27,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-27 04:28:27,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-27 04:28:27,480 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting inspectErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:28:27,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1572456404, now seen corresponding path program 1 times [2021-08-27 04:28:27,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:28:27,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730761813] [2021-08-27 04:28:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:27,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:28:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:28:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:28:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:28:28,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:28:28,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730761813] [2021-08-27 04:28:28,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730761813] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:28:28,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938495139] [2021-08-27 04:28:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:28,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:28:28,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:28:28,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:28:28,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 04:28:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:29,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 50 conjunts are in the unsatisfiable core [2021-08-27 04:28:29,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:29,558 INFO L388 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 [2021-08-27 04:28:29,759 INFO L388 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 [2021-08-27 04:28:29,775 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:28:29,775 INFO L388 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 11 [2021-08-27 04:28:29,832 INFO L388 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 21 treesize of output 17 [2021-08-27 04:28:29,841 INFO L388 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 [2021-08-27 04:28:30,061 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:28:30,062 INFO L388 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 45 [2021-08-27 04:28:30,075 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 04:28:30,075 INFO L388 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 55 treesize of output 50 [2021-08-27 04:28:30,321 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 04:28:30,322 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 66 [2021-08-27 04:28:30,346 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 04:28:30,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2021-08-27 04:28:34,648 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 04:28:34,649 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 88 [2021-08-27 04:28:34,677 INFO L354 Elim1Store]: treesize reduction 98, result has 21.6 percent of original size [2021-08-27 04:28:34,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 69 [2021-08-27 04:28:34,831 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:28:34,832 INFO L388 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 67 treesize of output 49 [2021-08-27 04:28:34,844 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 04:28:34,844 INFO L388 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 59 treesize of output 54 [2021-08-27 04:28:35,714 INFO L354 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2021-08-27 04:28:35,715 INFO L388 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 3 case distinctions, treesize of input 71 treesize of output 56 [2021-08-27 04:28:35,727 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 04:28:35,727 INFO L388 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 47 treesize of output 31 [2021-08-27 04:28:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:28:35,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938495139] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:28:35,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:28:35,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2021-08-27 04:28:35,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605513437] [2021-08-27 04:28:35,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-27 04:28:35,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:28:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-27 04:28:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1229, Unknown=2, NotChecked=0, Total=1332 [2021-08-27 04:28:35,736 INFO L87 Difference]: Start difference. First operand 284 states and 334 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 31 states have internal predecessors, (91), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:28:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:39,819 INFO L93 Difference]: Finished difference Result 339 states and 383 transitions. [2021-08-27 04:28:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 04:28:39,820 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 31 states have internal predecessors, (91), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2021-08-27 04:28:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:39,821 INFO L225 Difference]: With dead ends: 339 [2021-08-27 04:28:39,821 INFO L226 Difference]: Without dead ends: 339 [2021-08-27 04:28:39,822 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 6620.0ms TimeCoverageRelationStatistics Valid=348, Invalid=3072, Unknown=2, NotChecked=0, Total=3422 [2021-08-27 04:28:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-08-27 04:28:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 284. [2021-08-27 04:28:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 222 states have (on average 1.4189189189189189) internal successors, (315), 269 states have internal predecessors, (315), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 04:28:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 332 transitions. [2021-08-27 04:28:39,826 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 332 transitions. Word has length 53 [2021-08-27 04:28:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:39,826 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 332 transitions. [2021-08-27 04:28:39,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 31 states have internal predecessors, (91), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:28:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 332 transitions. [2021-08-27 04:28:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 04:28:39,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:39,827 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:28:39,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-27 04:28:40,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-27 04:28:40,046 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:28:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 159681268, now seen corresponding path program 1 times [2021-08-27 04:28:40,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:28:40,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688491793] [2021-08-27 04:28:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:40,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:28:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:40,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:28:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 04:28:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:28:40,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:28:40,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688491793] [2021-08-27 04:28:40,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688491793] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:28:40,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861367416] [2021-08-27 04:28:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:40,783 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:28:40,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:28:40,784 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:28:40,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 04:28:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:42,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 53 conjunts are in the unsatisfiable core [2021-08-27 04:28:42,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:42,229 INFO L388 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 [2021-08-27 04:28:42,430 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:28:42,430 INFO L388 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 11 [2021-08-27 04:28:42,481 INFO L388 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 16 treesize of output 12 [2021-08-27 04:28:42,643 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:28:42,644 INFO L388 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 28 treesize of output 22 [2021-08-27 04:28:42,831 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 04:28:42,831 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 34 [2021-08-27 04:28:49,134 INFO L354 Elim1Store]: treesize reduction 94, result has 22.3 percent of original size [2021-08-27 04:28:49,148 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 104 [2021-08-27 04:28:49,153 INFO L388 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 96 treesize of output 88 [2021-08-27 04:28:49,167 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-08-27 04:28:49,167 INFO L388 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 88 treesize of output 74 [2021-08-27 04:28:49,382 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 04:28:49,382 INFO L388 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 106 treesize of output 76 [2021-08-27 04:28:49,396 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 04:28:49,396 INFO L388 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 98 treesize of output 89 [2021-08-27 04:28:49,408 INFO L354 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2021-08-27 04:28:49,409 INFO L388 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 90 treesize of output 62 [2021-08-27 04:28:50,454 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 04:28:50,454 INFO L388 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 79 treesize of output 59 [2021-08-27 04:28:50,466 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 04:28:50,466 INFO L388 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 3 case distinctions, treesize of input 47 treesize of output 32 [2021-08-27 04:28:50,543 INFO L388 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 19 treesize of output 7 [2021-08-27 04:28:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:28:50,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861367416] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:28:50,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:28:50,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2021-08-27 04:28:50,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431627429] [2021-08-27 04:28:50,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-08-27 04:28:50,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:28:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-08-27 04:28:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1530, Unknown=2, NotChecked=0, Total=1640 [2021-08-27 04:28:50,557 INFO L87 Difference]: Start difference. First operand 284 states and 332 transitions. Second operand has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 35 states have internal predecessors, (94), 4 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:29:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:29:16,013 INFO L93 Difference]: Finished difference Result 338 states and 380 transitions. [2021-08-27 04:29:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 04:29:16,014 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 35 states have internal predecessors, (94), 4 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2021-08-27 04:29:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:29:16,015 INFO L225 Difference]: With dead ends: 338 [2021-08-27 04:29:16,015 INFO L226 Difference]: Without dead ends: 338 [2021-08-27 04:29:16,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 25380.7ms TimeCoverageRelationStatistics Valid=412, Invalid=4001, Unknown=9, NotChecked=0, Total=4422 [2021-08-27 04:29:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-08-27 04:29:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 284. [2021-08-27 04:29:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 222 states have (on average 1.40990990990991) internal successors, (313), 269 states have internal predecessors, (313), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-27 04:29:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 330 transitions. [2021-08-27 04:29:16,020 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 330 transitions. Word has length 56 [2021-08-27 04:29:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:29:16,021 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 330 transitions. [2021-08-27 04:29:16,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 35 states have internal predecessors, (94), 4 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:29:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 330 transitions. [2021-08-27 04:29:16,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 04:29:16,021 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:29:16,021 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:29:16,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 04:29:16,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-27 04:29:16,235 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 61 more)] === [2021-08-27 04:29:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:29:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1789567773, now seen corresponding path program 1 times [2021-08-27 04:29:16,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:29:16,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594882710] [2021-08-27 04:29:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:29:16,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:29:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:29:16,269 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:29:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:29:16,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:29:16,309 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:29:16,310 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:29:16,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:29:16,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr0REQUIRES_VIOLATION [2021-08-27 04:29:16,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr1REQUIRES_VIOLATION [2021-08-27 04:29:16,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr2REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr3REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr4REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr5REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr6REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr7REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr8REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr9REQUIRES_VIOLATION [2021-08-27 04:29:16,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr10REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr11REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr12REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr13REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr14REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr15REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr16REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr17REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr18REQUIRES_VIOLATION [2021-08-27 04:29:16,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr19REQUIRES_VIOLATION [2021-08-27 04:29:16,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr20REQUIRES_VIOLATION [2021-08-27 04:29:16,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr21REQUIRES_VIOLATION [2021-08-27 04:29:16,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr22REQUIRES_VIOLATION [2021-08-27 04:29:16,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr23REQUIRES_VIOLATION [2021-08-27 04:29:16,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr24REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr25REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr26REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr27REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr28REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr29REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr0REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr1REQUIRES_VIOLATION [2021-08-27 04:29:16,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr2REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr3REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr4REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr5REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr6REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr7REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr8REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr9REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr0REQUIRES_VIOLATION [2021-08-27 04:29:16,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr1REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr2REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr3REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr4REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr5REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr6REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr7REQUIRES_VIOLATION [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr9ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr10ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr11REQUIRES_VIOLATION [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr12REQUIRES_VIOLATION [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr13REQUIRES_VIOLATION [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr14REQUIRES_VIOLATION [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr15ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr16ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,318 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr17ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr18REQUIRES_VIOLATION [2021-08-27 04:29:16,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr19REQUIRES_VIOLATION [2021-08-27 04:29:16,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr20ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr21ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,319 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr22ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:29:16,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 04:29:16,325 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:29:16,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:29:16 BoogieIcfgContainer [2021-08-27 04:29:16,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:29:16,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:29:16,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:29:16,372 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:29:16,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/4) ... [2021-08-27 04:29:16,374 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:29:16,427 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:29:16,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:29:16,428 INFO L168 Benchmark]: Toolchain (without parser) took 184181.49 ms. Allocated memory was 54.5 MB in the beginning and 297.8 MB in the end (delta: 243.3 MB). Free memory was 30.6 MB in the beginning and 173.9 MB in the end (delta: -143.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:16,428 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 44.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:29:16,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.80 ms. Allocated memory is still 54.5 MB. Free memory was 30.5 MB in the beginning and 31.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:16,428 INFO L168 Benchmark]: Boogie Preprocessor took 80.83 ms. Allocated memory is still 54.5 MB. Free memory was 31.8 MB in the beginning and 28.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:16,428 INFO L168 Benchmark]: RCFGBuilder took 688.61 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 28.7 MB in the beginning and 35.0 MB in the end (delta: -6.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:16,429 INFO L168 Benchmark]: TraceAbstraction took 183054.19 ms. Allocated memory was 67.1 MB in the beginning and 297.8 MB in the end (delta: 230.7 MB). Free memory was 34.4 MB in the beginning and 177.0 MB in the end (delta: -142.6 MB). Peak memory consumption was 88.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:16,429 INFO L168 Benchmark]: Witness Printer took 55.66 ms. Allocated memory is still 297.8 MB. Free memory was 177.0 MB in the beginning and 173.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:29:16,430 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.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 44.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 296.80 ms. Allocated memory is still 54.5 MB. Free memory was 30.5 MB in the beginning and 31.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 80.83 ms. Allocated memory is still 54.5 MB. Free memory was 31.8 MB in the beginning and 28.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 688.61 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 28.7 MB in the beginning and 35.0 MB in the end (delta: -6.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 183054.19 ms. Allocated memory was 67.1 MB in the beginning and 297.8 MB in the end (delta: 230.7 MB). Free memory was 34.4 MB in the beginning and 177.0 MB in the end (delta: -142.6 MB). Peak memory consumption was 88.6 MB. Max. memory is 16.1 GB. * Witness Printer took 55.66 ms. Allocated memory is still 297.8 MB. Free memory was 177.0 MB in the beginning and 173.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L632] CALL, EXPR create_tree() [L585] struct node *nodelast = ((void *)0); [L586] struct node *node = ((void *)0); VAL [node={0:0}, nodelast={0:0}] [L587] COND TRUE __VERIFIER_nondet_int() [L588] node = malloc(sizeof *node) [L589] COND FALSE !(!node) VAL [node={-1:0}, nodelast={0:0}] [L591] node->left = ((void *)0) VAL [node={-1:0}, nodelast={0:0}] [L592] node->right = nodelast VAL [node={-1:0}, nodelast={0:0}] [L593] COND FALSE !(\read(*nodelast)) VAL [node={-1:0}, nodelast={0:0}] [L595] int value = __VERIFIER_nondet_int(); [L596] node->value = value VAL [node={-1:0}, nodelast={0:0}, value=0] [L597] nodelast = node VAL [node={-1:0}, nodelast={-1:0}, value=0] [L587] COND FALSE !(__VERIFIER_nondet_int()) [L599] COND TRUE node != ((void *)0) VAL [node={-1:0}, nodelast={-1:0}, value=0] [L600] node->parent = ((void *)0) VAL [node={-1:0}, nodelast={-1:0}, value=0] [L601] COND TRUE node != ((void *)0) [L602] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={-2:0}, node={-1:0}, nodelast={-1:0}, value=0] [L603] COND FALSE !(!node) VAL [node={-1:0}, nodelast={-1:0}, value=0] [L605] EXPR node->left VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L605] node->left->left = ((void *)0) VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L606] EXPR node->left VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L606] node->left->right = ((void *)0) VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L607] EXPR node->left VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L607] node->left->value = 42 VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L608] EXPR node->left VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L608] node->left->parent = node VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L609] EXPR node->right VAL [node={-1:0}, node->right={0:0}, nodelast={-1:0}, value=0] [L609] node = node->right [L601] COND FALSE !(node != ((void *)0)) VAL [node={0:0}, nodelast={-1:0}, value=0] [L611] return nodelast; VAL [\result={-1:0}, node={0:0}, nodelast={-1:0}, value=0] [L632] RET, EXPR create_tree() VAL [create_tree()={-1:0}] [L632] struct node *data = create_tree(); [L633] COND FALSE !(!data) VAL [data={-1:0}] [L635] CALL inspect(data) VAL [node={-1:0}] [L575] COND FALSE !(!(node)) VAL [node={-1:0}, node={-1:0}] [L576] COND TRUE node != ((void *)0) VAL [node={-1:0}, node={-1:0}] [L577] node->left VAL [node={-1:0}, node={-1:0}, node->left={-2:0}] [L577] COND TRUE node->left [L578] EXPR node->left VAL [node={-1:0}, node={-1:0}, node->left={-2:0}] [L578] EXPR node->left->value VAL [node={-1:0}, node={-1:0}, node->left={-2:0}, node->left->value=42] [L578] COND FALSE !(!(node->left->value == 42)) [L579] EXPR node->value VAL [node={-1:0}, node={-1:0}, node->value=0] [L579] COND TRUE !(node->value) [L579] CALL fail() [L565] reach_error() - UnprovableResult [Line: 630]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 622]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 173 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 182941.0ms, OverallIterations: 29, TraceHistogramMax: 3, EmptinessCheckTime: 37.7ms, AutomataDifference: 119000.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2484 SDtfs, 7028 SDslu, 5910 SDs, 0 SdLazy, 33249 SolverSat, 864 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 37175.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1141 GetRequests, 500 SyntacticMatches, 3 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6004 ImplicationChecksByTransitivity, 113558.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=26, InterpolantAutomatonStates: 408, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 112.8ms AutomataMinimizationTime, 28 MinimizatonAttempts, 1365 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 192.4ms SsaConstructionTime, 660.1ms SatisfiabilityAnalysisTime, 53239.7ms InterpolantComputationTime, 1501 NumberOfCodeBlocks, 1501 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1403 ConstructedInterpolants, 169 QuantifiedInterpolants, 24583 SizeOfPredicates, 151 NumberOfNonLiveVariables, 2844 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 81/152 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! [2021-08-27 04:29:16,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...