./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/tree-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8850e617230fbb23d096e299440f36502352977 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8850e617230fbb23d096e299440f36502352977 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:26:50,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:26:50,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:26:50,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:26:50,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:26:50,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:26:50,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:26:50,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:26:50,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:26:50,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:26:50,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:26:50,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:26:50,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:26:50,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:26:50,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:26:50,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:26:50,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:26:50,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:26:50,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:26:50,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:26:50,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:26:50,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:26:50,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:26:50,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:26:50,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:26:50,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:26:50,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:26:50,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:26:50,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:26:50,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:26:50,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:26:50,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:26:50,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:26:50,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:26:50,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:26:50,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:26:50,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:26:50,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:26:50,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:26:50,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:26:50,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:26:50,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:26:50,734 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:26:50,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:26:50,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:26:50,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:26:50,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:26:50,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:26:50,737 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:26:50,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:26:50,737 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:26:50,737 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:26:50,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:26:50,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:26:50,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:26:50,738 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:26:50,738 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:26:50,738 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:26:50,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:26:50,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:26:50,739 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:26:50,739 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:26:50,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:26:50,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:26:50,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:26:50,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:26:50,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:26:50,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:26:50,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:26:50,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:26:50,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:26:50,741 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8850e617230fbb23d096e299440f36502352977 [2021-08-27 06:26:51,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:26:51,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:26:51,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:26:51,092 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:26:51,093 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:26:51,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-2.i [2021-08-27 06:26:51,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead09ef8b/73896d3b44eb448ca5fa8792c10a0264/FLAG99581d369 [2021-08-27 06:26:51,726 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:26:51,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-2.i [2021-08-27 06:26:51,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead09ef8b/73896d3b44eb448ca5fa8792c10a0264/FLAG99581d369 [2021-08-27 06:26:52,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead09ef8b/73896d3b44eb448ca5fa8792c10a0264 [2021-08-27 06:26:52,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:26:52,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:26:52,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:26:52,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:26:52,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:26:52,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4829e230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52, skipping insertion in model container [2021-08-27 06:26:52,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:26:52,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:26:52,405 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-2.i[22626,22639] [2021-08-27 06:26:52,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:26:52,455 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:26:52,496 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-2.i[22626,22639] [2021-08-27 06:26:52,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:26:52,535 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:26:52,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52 WrapperNode [2021-08-27 06:26:52,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:26:52,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:26:52,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:26:52,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:26:52,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:26:52,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:26:52,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:26:52,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:26:52,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (1/1) ... [2021-08-27 06:26:52,639 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:26:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:26:52,653 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 06:26:52,661 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 06:26:52,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:26:52,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:26:52,690 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:26:52,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 06:26:52,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 06:26:52,691 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-27 06:26:52,699 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-08-27 06:26:52,699 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2021-08-27 06:26:52,699 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2021-08-27 06:26:52,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:26:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:26:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:26:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:26:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:26:52,702 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:26:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:26:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 06:26:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 06:26:52,706 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:26:52,706 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:26:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:26:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:26:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:26:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:26:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:26:52,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:26:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:26:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:26:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:26:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:26:52,708 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:26:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:26:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:26:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:26:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:26:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:26:52,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:26:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:26:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:26:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:26:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:26:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:26:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:26:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:26:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:26:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:26:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:26:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:26:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:26:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:26:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:26:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:26:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:26:52,713 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:26:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:26:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:26:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:26:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:26:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:26:52,714 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:26:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:26:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:26:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:26:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:26:52,715 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:26:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:26:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:26:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:26:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:26:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:26:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:26:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:26:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:26:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:26:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:26:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:26:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:26:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:26:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:26:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:26:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:26:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:26:52,720 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:26:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:26:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:26:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:26:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:26:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:26:52,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:26:52,722 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:26:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:26:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:26:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:26:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:26:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:26:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:26:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:26:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:26:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:26:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:26:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:26:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:26:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:26:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:26:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:26:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:26:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-27 06:26:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-08-27 06:26:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:26:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:26:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2021-08-27 06:26:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:26:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:26:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:26:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2021-08-27 06:26:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:26:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:26:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:26:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:26:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:26:53,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:26:53,413 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-27 06:26:53,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:26:53 BoogieIcfgContainer [2021-08-27 06:26:53,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:26:53,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:26:53,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:26:53,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:26:53,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:26:52" (1/3) ... [2021-08-27 06:26:53,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3113b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:26:53, skipping insertion in model container [2021-08-27 06:26:53,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:26:52" (2/3) ... [2021-08-27 06:26:53,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3113b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:26:53, skipping insertion in model container [2021-08-27 06:26:53,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:26:53" (3/3) ... [2021-08-27 06:26:53,430 INFO L111 eAbstractionObserver]: Analyzing ICFG tree-2.i [2021-08-27 06:26:53,435 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:26:53,436 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2021-08-27 06:26:53,471 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:26:53,477 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 06:26:53,477 INFO L340 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2021-08-27 06:26:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 82 states have (on average 2.097560975609756) internal successors, (172), 148 states have internal predecessors, (172), 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 06:26:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:26:53,500 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:53,500 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:53,501 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting create_treeErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:53,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1547396187, now seen corresponding path program 1 times [2021-08-27 06:26:53,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:53,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242514841] [2021-08-27 06:26:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:53,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:53,672 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 06:26:53,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:53,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242514841] [2021-08-27 06:26:53,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242514841] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:53,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:53,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:26:53,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462914185] [2021-08-27 06:26:53,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:26:53,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:26:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:26:53,692 INFO L87 Difference]: Start difference. First operand has 160 states, 82 states have (on average 2.097560975609756) internal successors, (172), 148 states have internal predecessors, (172), 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 06:26:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:53,960 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2021-08-27 06:26:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:26:53,962 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 06:26:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:53,970 INFO L225 Difference]: With dead ends: 208 [2021-08-27 06:26:53,971 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 06:26:53,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:26:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 06:26:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2021-08-27 06:26:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 87 states have (on average 1.8735632183908046) internal successors, (163), 151 states have internal predecessors, (163), 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 06:26:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2021-08-27 06:26:54,011 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 10 [2021-08-27 06:26:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:54,012 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2021-08-27 06:26:54,012 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 06:26:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2021-08-27 06:26:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:26:54,013 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:54,013 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:54,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:26:54,013 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting create_treeErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 723620971, now seen corresponding path program 1 times [2021-08-27 06:26:54,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:54,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618508158] [2021-08-27 06:26:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:54,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:54,092 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 06:26:54,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:54,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618508158] [2021-08-27 06:26:54,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618508158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:54,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:54,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:26:54,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691742666] [2021-08-27 06:26:54,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:26:54,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:26:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:54,096 INFO L87 Difference]: Start difference. First operand 163 states and 176 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 06:26:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:54,478 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2021-08-27 06:26:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:26:54,479 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 06:26:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:54,482 INFO L225 Difference]: With dead ends: 203 [2021-08-27 06:26:54,482 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 06:26:54,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:26:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 06:26:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2021-08-27 06:26:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 87 states have (on average 1.8620689655172413) internal successors, (162), 151 states have internal predecessors, (162), 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 06:26:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2021-08-27 06:26:54,513 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 11 [2021-08-27 06:26:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:54,513 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2021-08-27 06:26:54,513 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 06:26:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2021-08-27 06:26:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:26:54,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:54,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:54,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:26:54,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting create_treeErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 723621870, now seen corresponding path program 1 times [2021-08-27 06:26:54,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:54,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018154347] [2021-08-27 06:26:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:54,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:54,613 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 06:26:54,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:54,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018154347] [2021-08-27 06:26:54,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018154347] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:54,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:54,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:26:54,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951536161] [2021-08-27 06:26:54,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:26:54,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:54,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:26:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:54,621 INFO L87 Difference]: Start difference. First operand 163 states and 175 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 06:26:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:54,948 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2021-08-27 06:26:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:26:54,950 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 06:26:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:54,951 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:26:54,951 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 06:26:54,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 06:26:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 157. [2021-08-27 06:26:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 89 states have (on average 1.7752808988764044) internal successors, (158), 145 states have internal predecessors, (158), 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 06:26:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2021-08-27 06:26:54,969 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 11 [2021-08-27 06:26:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:54,969 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2021-08-27 06:26:54,969 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 06:26:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2021-08-27 06:26:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:26:54,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:54,970 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:54,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:26:54,971 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting create_treeErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash 723621871, now seen corresponding path program 1 times [2021-08-27 06:26:54,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:54,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905290573] [2021-08-27 06:26:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:54,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,063 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 06:26:55,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:55,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905290573] [2021-08-27 06:26:55,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905290573] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:55,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:55,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:26:55,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975609411] [2021-08-27 06:26:55,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:26:55,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:26:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:55,068 INFO L87 Difference]: Start difference. First operand 157 states and 171 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 06:26:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:55,421 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2021-08-27 06:26:55,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:26:55,422 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 06:26:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:55,423 INFO L225 Difference]: With dead ends: 221 [2021-08-27 06:26:55,423 INFO L226 Difference]: Without dead ends: 221 [2021-08-27 06:26:55,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-27 06:26:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 169. [2021-08-27 06:26:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.7019230769230769) internal successors, (177), 157 states have internal predecessors, (177), 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 06:26:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2021-08-27 06:26:55,428 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 11 [2021-08-27 06:26:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:55,429 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2021-08-27 06:26:55,429 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 06:26:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2021-08-27 06:26:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 06:26:55,430 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:55,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:26:55,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:26:55,430 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting create_treeErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash 978285602, now seen corresponding path program 1 times [2021-08-27 06:26:55,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:55,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976117422] [2021-08-27 06:26:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:55,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,488 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 06:26:55,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:55,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976117422] [2021-08-27 06:26:55,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976117422] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:55,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:55,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:26:55,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393571311] [2021-08-27 06:26:55,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:26:55,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:26:55,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:26:55,490 INFO L87 Difference]: Start difference. First operand 169 states and 190 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 06:26:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:55,788 INFO L93 Difference]: Finished difference Result 216 states and 242 transitions. [2021-08-27 06:26:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:26:55,789 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 06:26:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:55,790 INFO L225 Difference]: With dead ends: 216 [2021-08-27 06:26:55,790 INFO L226 Difference]: Without dead ends: 216 [2021-08-27 06:26:55,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:26:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-27 06:26:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 173. [2021-08-27 06:26:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 108 states have (on average 1.6759259259259258) internal successors, (181), 161 states have internal predecessors, (181), 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 06:26:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2021-08-27 06:26:55,794 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 14 [2021-08-27 06:26:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:55,795 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2021-08-27 06:26:55,795 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 06:26:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2021-08-27 06:26:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:26:55,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:55,796 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] [2021-08-27 06:26:55,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:26:55,796 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 396677598, now seen corresponding path program 1 times [2021-08-27 06:26:55,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:55,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167380578] [2021-08-27 06:26:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:55,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:26:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:55,960 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 06:26:55,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:55,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167380578] [2021-08-27 06:26:55,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167380578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:55,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:55,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:26:55,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208079504] [2021-08-27 06:26:55,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:26:55,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:26:55,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:26:55,963 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 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 06:26:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:56,633 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2021-08-27 06:26:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:26:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 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 20 [2021-08-27 06:26:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:56,635 INFO L225 Difference]: With dead ends: 216 [2021-08-27 06:26:56,635 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 06:26:56,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 236.2ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:26:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 06:26:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 167. [2021-08-27 06:26:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 103 states have (on average 1.6990291262135921) 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 06:26:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2021-08-27 06:26:56,640 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 20 [2021-08-27 06:26:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:56,640 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2021-08-27 06:26:56,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 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 06:26:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2021-08-27 06:26:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:26:56,641 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:56,641 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 06:26:56,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:26:56,642 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_treeErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 513777443, now seen corresponding path program 1 times [2021-08-27 06:26:56,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:56,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100565655] [2021-08-27 06:26:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:56,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:56,732 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 06:26:56,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:56,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100565655] [2021-08-27 06:26:56,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100565655] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:26:56,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919572906] [2021-08-27 06:26:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:56,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:26:56,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:26:56,736 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 06:26:56,772 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 06:26:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:56,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:26:56,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:57,053 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 06:26:57,126 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:26:57,127 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 06:26:57,273 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 06:26:57,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919572906] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:26:57,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:26:57,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-08-27 06:26:57,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221245215] [2021-08-27 06:26:57,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:26:57,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:26:57,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:26:57,275 INFO L87 Difference]: Start difference. First operand 167 states and 187 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 06:26:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:57,847 INFO L93 Difference]: Finished difference Result 216 states and 241 transitions. [2021-08-27 06:26:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:26:57,848 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 06:26:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:57,849 INFO L225 Difference]: With dead ends: 216 [2021-08-27 06:26:57,849 INFO L226 Difference]: Without dead ends: 216 [2021-08-27 06:26:57,850 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:26:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-27 06:26:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2021-08-27 06:26:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.6893203883495145) internal successors, (174), 155 states have internal predecessors, (174), 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 06:26:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2021-08-27 06:26:57,854 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 23 [2021-08-27 06:26:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:57,855 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2021-08-27 06:26:57,855 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 06:26:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2021-08-27 06:26:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:26:57,855 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:57,856 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 06:26:57,885 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 06:26:58,080 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 06:26:58,081 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_treeErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 513777444, now seen corresponding path program 1 times [2021-08-27 06:26:58,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:58,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398088403] [2021-08-27 06:26:58,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:58,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:58,168 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 06:26:58,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:58,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398088403] [2021-08-27 06:26:58,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398088403] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:26:58,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952564627] [2021-08-27 06:26:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:58,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:26:58,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:26:58,177 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 06:26:58,178 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 06:26:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:58,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:26:58,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:26:58,367 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 06:26:58,374 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 06:26:58,549 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:26:58,549 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 06:26:58,557 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:26:58,558 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 06:26:58,682 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 06:26:58,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952564627] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:26:58,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:26:58,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-27 06:26:58,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419127466] [2021-08-27 06:26:58,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:26:58,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:26:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:26:58,684 INFO L87 Difference]: Start difference. First operand 166 states and 186 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 06:26:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:59,226 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2021-08-27 06:26:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:26:59,227 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 06:26:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:59,228 INFO L225 Difference]: With dead ends: 224 [2021-08-27 06:26:59,228 INFO L226 Difference]: Without dead ends: 224 [2021-08-27 06:26:59,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 106.6ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:26:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-08-27 06:26:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 165. [2021-08-27 06:26:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 154 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 06:26:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2021-08-27 06:26:59,232 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 23 [2021-08-27 06:26:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:59,233 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2021-08-27 06:26:59,233 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 06:26:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2021-08-27 06:26:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:26:59,234 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:59,234 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] [2021-08-27 06:26:59,271 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 06:26:59,458 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 06:26:59,459 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_treeErr12REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2082059470, now seen corresponding path program 1 times [2021-08-27 06:26:59,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:59,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796809999] [2021-08-27 06:26:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:59,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:26:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:26:59,526 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 06:26:59,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:26:59,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796809999] [2021-08-27 06:26:59,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796809999] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:26:59,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:26:59,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:26:59,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462987220] [2021-08-27 06:26:59,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:26:59,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:26:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:26:59,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:26:59,532 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 06:26:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:26:59,935 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-08-27 06:26:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:26:59,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 24 [2021-08-27 06:26:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:26:59,937 INFO L225 Difference]: With dead ends: 202 [2021-08-27 06:26:59,937 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 06:26:59,937 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:26:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 06:26:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2021-08-27 06:26:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 103 states have (on average 1.6601941747572815) internal successors, (171), 153 states have internal predecessors, (171), 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 06:26:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2021-08-27 06:26:59,942 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 24 [2021-08-27 06:26:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:26:59,942 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2021-08-27 06:26:59,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 06:26:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2021-08-27 06:26:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:26:59,943 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:26:59,943 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] [2021-08-27 06:26:59,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:26:59,944 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_treeErr13REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:26:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:26:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2082059469, now seen corresponding path program 1 times [2021-08-27 06:26:59,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:26:59,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378940485] [2021-08-27 06:26:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:26:59,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:26:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:00,022 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 06:27:00,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:00,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378940485] [2021-08-27 06:27:00,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378940485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:00,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:00,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:27:00,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992828536] [2021-08-27 06:27:00,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:27:00,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:00,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:27:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:27:00,025 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 06:27:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:00,470 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2021-08-27 06:27:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:27:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 24 [2021-08-27 06:27:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:00,472 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:27:00,472 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 06:27:00,473 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:27:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 06:27:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2021-08-27 06:27:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 152 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 06:27:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2021-08-27 06:27:00,477 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 24 [2021-08-27 06:27:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:00,477 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2021-08-27 06:27:00,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 06:27:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2021-08-27 06:27:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:27:00,478 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:00,478 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] [2021-08-27 06:27:00,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:27:00,479 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash -560010483, now seen corresponding path program 1 times [2021-08-27 06:27:00,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:00,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50265420] [2021-08-27 06:27:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:00,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:27:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:00,542 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 06:27:00,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:00,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50265420] [2021-08-27 06:27:00,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50265420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:00,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:00,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:27:00,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257502159] [2021-08-27 06:27:00,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:27:00,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:00,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:27:00,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:27:00,544 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 06:27:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:00,904 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2021-08-27 06:27:00,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:27:00,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 25 [2021-08-27 06:27:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:00,906 INFO L225 Difference]: With dead ends: 208 [2021-08-27 06:27:00,906 INFO L226 Difference]: Without dead ends: 208 [2021-08-27 06:27:00,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:27:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-08-27 06:27:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 163. [2021-08-27 06:27:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 152 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 06:27:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2021-08-27 06:27:00,911 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 25 [2021-08-27 06:27:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:00,911 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2021-08-27 06:27:00,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 06:27:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2021-08-27 06:27:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:27:00,912 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:00,912 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] [2021-08-27 06:27:00,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:27:00,913 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_treeErr16REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1284076684, now seen corresponding path program 1 times [2021-08-27 06:27:00,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:00,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664815043] [2021-08-27 06:27:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:00,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:01,019 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 06:27:01,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:01,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664815043] [2021-08-27 06:27:01,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664815043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:01,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:01,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:27:01,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538058198] [2021-08-27 06:27:01,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:27:01,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:27:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:27:01,022 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:27:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:01,665 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2021-08-27 06:27:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:27:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 27 [2021-08-27 06:27:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:01,667 INFO L225 Difference]: With dead ends: 202 [2021-08-27 06:27:01,667 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 06:27:01,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 123.7ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:27:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 06:27:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2021-08-27 06:27:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 152 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 06:27:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2021-08-27 06:27:01,671 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 27 [2021-08-27 06:27:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:01,671 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2021-08-27 06:27:01,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:27:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2021-08-27 06:27:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:27:01,672 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:01,672 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] [2021-08-27 06:27:01,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:27:01,673 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_treeErr17REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1284076685, now seen corresponding path program 1 times [2021-08-27 06:27:01,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:01,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158227688] [2021-08-27 06:27:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:01,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:01,807 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 06:27:01,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:01,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158227688] [2021-08-27 06:27:01,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158227688] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:01,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:01,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:27:01,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469102274] [2021-08-27 06:27:01,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:27:01,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:27:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:27:01,809 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:27:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:02,511 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2021-08-27 06:27:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:27:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 27 [2021-08-27 06:27:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:02,513 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:27:02,513 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 06:27:02,513 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 149.4ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:27:02,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 06:27:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2021-08-27 06:27:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 152 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 06:27:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2021-08-27 06:27:02,517 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 27 [2021-08-27 06:27:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:02,518 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2021-08-27 06:27:02,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 06:27:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2021-08-27 06:27:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:27:02,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:02,519 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] [2021-08-27 06:27:02,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 06:27:02,519 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_treeErr20REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1345146855, now seen corresponding path program 1 times [2021-08-27 06:27:02,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:02,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540182930] [2021-08-27 06:27:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:02,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:02,642 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 06:27:02,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:02,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540182930] [2021-08-27 06:27:02,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540182930] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:02,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:02,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:27:02,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443287046] [2021-08-27 06:27:02,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:27:02,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:27:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:27:02,644 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 06:27:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:03,263 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2021-08-27 06:27:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:27:03,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2021-08-27 06:27:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:03,266 INFO L225 Difference]: With dead ends: 202 [2021-08-27 06:27:03,266 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 06:27:03,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 131.6ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:27:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 06:27:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2021-08-27 06:27:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.6019417475728155) internal successors, (165), 152 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 06:27:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-08-27 06:27:03,273 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 30 [2021-08-27 06:27:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:03,273 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-08-27 06:27:03,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 06:27:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-08-27 06:27:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:27:03,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:03,276 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] [2021-08-27 06:27:03,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:27:03,277 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_treeErr21REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1345146854, now seen corresponding path program 1 times [2021-08-27 06:27:03,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:03,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091151922] [2021-08-27 06:27:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:03,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:03,479 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 06:27:03,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:03,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091151922] [2021-08-27 06:27:03,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091151922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:03,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:03,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:27:03,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026879745] [2021-08-27 06:27:03,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:27:03,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:27:03,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:27:03,482 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 06:27:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:04,182 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2021-08-27 06:27:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:27:04,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2021-08-27 06:27:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:04,184 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:27:04,184 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 06:27:04,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 183.0ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:27:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 06:27:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2021-08-27 06:27:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.5922330097087378) internal successors, (164), 152 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 06:27:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2021-08-27 06:27:04,190 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 30 [2021-08-27 06:27:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:04,191 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2021-08-27 06:27:04,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 06:27:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2021-08-27 06:27:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:27:04,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:04,192 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] [2021-08-27 06:27:04,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:27:04,192 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_treeErr24REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1225013101, now seen corresponding path program 1 times [2021-08-27 06:27:04,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:04,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947488171] [2021-08-27 06:27:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:04,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:04,368 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 06:27:04,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:04,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947488171] [2021-08-27 06:27:04,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947488171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:04,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:04,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:27:04,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550409084] [2021-08-27 06:27:04,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:27:04,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:27:04,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:27:04,370 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 06:27:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:05,087 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2021-08-27 06:27:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:27:05,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 33 [2021-08-27 06:27:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:05,089 INFO L225 Difference]: With dead ends: 203 [2021-08-27 06:27:05,089 INFO L226 Difference]: Without dead ends: 203 [2021-08-27 06:27:05,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 187.8ms TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2021-08-27 06:27:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-08-27 06:27:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2021-08-27 06:27:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.5825242718446602) internal successors, (163), 152 states have internal predecessors, (163), 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 06:27:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2021-08-27 06:27:05,093 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 33 [2021-08-27 06:27:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:05,098 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2021-08-27 06:27:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 06:27:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2021-08-27 06:27:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:27:05,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:05,102 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] [2021-08-27 06:27:05,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:27:05,102 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_treeErr25REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1225013100, now seen corresponding path program 1 times [2021-08-27 06:27:05,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:05,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952123868] [2021-08-27 06:27:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:05,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:05,332 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 06:27:05,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:05,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952123868] [2021-08-27 06:27:05,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952123868] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:05,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:05,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:27:05,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187585812] [2021-08-27 06:27:05,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:27:05,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:27:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:27:05,334 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 06:27:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:05,846 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2021-08-27 06:27:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:27:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 33 [2021-08-27 06:27:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:05,847 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:27:05,847 INFO L226 Difference]: Without dead ends: 201 [2021-08-27 06:27:05,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 175.5ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:27:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-08-27 06:27:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2021-08-27 06:27:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.5728155339805825) internal successors, (162), 152 states have internal predecessors, (162), 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 06:27:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2021-08-27 06:27:05,851 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 33 [2021-08-27 06:27:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:05,851 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2021-08-27 06:27:05,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 06:27:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2021-08-27 06:27:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:27:05,852 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:05,852 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] [2021-08-27 06:27:05,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:27:05,853 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting create_treeErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:05,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1232665023, now seen corresponding path program 1 times [2021-08-27 06:27:05,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:05,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958330828] [2021-08-27 06:27:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:05,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:06,171 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 06:27:06,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:06,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958330828] [2021-08-27 06:27:06,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958330828] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:06,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527487209] [2021-08-27 06:27:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:06,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:27:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:27:06,174 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 06:27:06,175 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 06:27:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:06,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-27 06:27:06,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:06,415 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 06:27:06,455 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 06:27:06,461 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 06:27:06,509 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 06:27:06,510 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 06:27:06,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:27:06,517 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 06:27:06,573 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:27:06,574 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 06:27:06,607 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 0 case distinctions, treesize of input 24 treesize of output 19 [2021-08-27 06:27:06,627 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-08-27 06:27:06,627 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 33 treesize of output 37 [2021-08-27 06:27:06,647 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 0 case distinctions, treesize of input 28 treesize of output 23 [2021-08-27 06:27:06,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:27:06,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:27:06,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2021-08-27 06:27:06,747 INFO L354 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2021-08-27 06:27:06,748 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 65 treesize of output 54 [2021-08-27 06:27:06,762 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-08-27 06:27:06,763 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 57 treesize of output 52 [2021-08-27 06:27:06,967 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-27 06:27:06,967 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 91 treesize of output 75 [2021-08-27 06:27:06,989 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:27:06,990 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 83 treesize of output 81 [2021-08-27 06:27:11,201 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-08-27 06:27:11,201 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 115 treesize of output 97 [2021-08-27 06:27:11,227 INFO L354 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2021-08-27 06:27:11,227 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 90 treesize of output 71 [2021-08-27 06:27:11,336 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-08-27 06:27:11,336 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 69 treesize of output 58 [2021-08-27 06:27:11,349 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:27:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2021-08-27 06:27:11,454 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:27:11,455 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 71 treesize of output 44 [2021-08-27 06:27:11,462 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:27:11,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2021-08-27 06:27:11,498 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 06:27:11,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527487209] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:11,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:27:11,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2021-08-27 06:27:11,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529881939] [2021-08-27 06:27:11,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:27:11,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:27:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=386, Unknown=2, NotChecked=0, Total=462 [2021-08-27 06:27:11,502 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 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 06:27:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:31,257 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2021-08-27 06:27:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 06:27:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 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 38 [2021-08-27 06:27:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:31,259 INFO L225 Difference]: With dead ends: 228 [2021-08-27 06:27:31,259 INFO L226 Difference]: Without dead ends: 228 [2021-08-27 06:27:31,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 18779.5ms TimeCoverageRelationStatistics Valid=216, Invalid=1257, Unknown=9, NotChecked=0, Total=1482 [2021-08-27 06:27:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-08-27 06:27:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2021-08-27 06:27:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 176 states have internal predecessors, (187), 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 06:27:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2021-08-27 06:27:31,264 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 38 [2021-08-27 06:27:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:31,264 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2021-08-27 06:27:31,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 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 06:27:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2021-08-27 06:27:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 06:27:31,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:31,265 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] [2021-08-27 06:27:31,296 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 06:27:31,480 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 06:27:31,481 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash -634142666, now seen corresponding path program 1 times [2021-08-27 06:27:31,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:31,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437992410] [2021-08-27 06:27:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:31,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:27:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:31,627 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 06:27:31,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:31,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437992410] [2021-08-27 06:27:31,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437992410] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:31,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:31,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:27:31,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690473149] [2021-08-27 06:27:31,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:27:31,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:27:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:27:31,631 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 6 states have internal predecessors, (38), 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 06:27:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:32,137 INFO L93 Difference]: Finished difference Result 226 states and 239 transitions. [2021-08-27 06:27:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:27:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 6 states have internal predecessors, (38), 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 43 [2021-08-27 06:27:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:32,143 INFO L225 Difference]: With dead ends: 226 [2021-08-27 06:27:32,144 INFO L226 Difference]: Without dead ends: 226 [2021-08-27 06:27:32,144 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:27:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-08-27 06:27:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 187. [2021-08-27 06:27:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 176 states have internal predecessors, (185), 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 06:27:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2021-08-27 06:27:32,148 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 43 [2021-08-27 06:27:32,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:32,148 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2021-08-27 06:27:32,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 6 states have internal predecessors, (38), 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 06:27:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2021-08-27 06:27:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 06:27:32,149 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:32,149 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] [2021-08-27 06:27:32,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 06:27:32,150 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash 775098568, now seen corresponding path program 1 times [2021-08-27 06:27:32,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:32,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704745630] [2021-08-27 06:27:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:32,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:27:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:32,298 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 06:27:32,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:32,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704745630] [2021-08-27 06:27:32,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704745630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:32,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:32,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 06:27:32,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949758399] [2021-08-27 06:27:32,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:27:32,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:27:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:27:32,301 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 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 06:27:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:32,983 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2021-08-27 06:27:32,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:27:32,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 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 47 [2021-08-27 06:27:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:32,985 INFO L225 Difference]: With dead ends: 249 [2021-08-27 06:27:32,985 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 06:27:32,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 146.6ms TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:27:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 06:27:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 187. [2021-08-27 06:27:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.4453125) internal successors, (185), 176 states have internal predecessors, (185), 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 06:27:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 196 transitions. [2021-08-27 06:27:32,989 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 196 transitions. Word has length 47 [2021-08-27 06:27:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:32,990 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 196 transitions. [2021-08-27 06:27:32,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 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 06:27:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 196 transitions. [2021-08-27 06:27:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:27:32,991 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:32,991 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] [2021-08-27 06:27:32,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 06:27:32,991 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting inspectErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1741814919, now seen corresponding path program 1 times [2021-08-27 06:27:32,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:32,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051314755] [2021-08-27 06:27:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:32,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:27:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:33,135 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 06:27:33,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:33,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051314755] [2021-08-27 06:27:33,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051314755] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:33,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977881302] [2021-08-27 06:27:33,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:33,136 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:27:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:27:33,144 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 06:27:33,146 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 06:27:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:33,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:27:33,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:33,537 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 06:27:33,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977881302] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:33,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:27:33,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2021-08-27 06:27:33,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426653087] [2021-08-27 06:27:33,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:27:33,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:27:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:27:33,540 INFO L87 Difference]: Start difference. First operand 187 states and 196 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 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 06:27:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:34,229 INFO L93 Difference]: Finished difference Result 225 states and 237 transitions. [2021-08-27 06:27:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:27:34,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 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 48 [2021-08-27 06:27:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:34,231 INFO L225 Difference]: With dead ends: 225 [2021-08-27 06:27:34,231 INFO L226 Difference]: Without dead ends: 225 [2021-08-27 06:27:34,231 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 175.2ms TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:27:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-08-27 06:27:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 185. [2021-08-27 06:27:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 129 states have (on average 1.426356589147287) internal successors, (184), 174 states have internal predecessors, (184), 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 06:27:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 195 transitions. [2021-08-27 06:27:34,234 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 195 transitions. Word has length 48 [2021-08-27 06:27:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:34,234 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 195 transitions. [2021-08-27 06:27:34,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 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 06:27:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 195 transitions. [2021-08-27 06:27:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:27:34,235 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:34,235 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] [2021-08-27 06:27:34,254 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 06:27:34,441 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 06:27:34,441 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting inspectErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1741814918, now seen corresponding path program 1 times [2021-08-27 06:27:34,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:34,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999628792] [2021-08-27 06:27:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:34,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:34,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:27:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:34,637 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 06:27:34,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:34,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999628792] [2021-08-27 06:27:34,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999628792] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:34,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677452262] [2021-08-27 06:27:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:34,638 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:27:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:27:34,645 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 06:27:34,646 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 06:27:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:34,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:27:34,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:35,371 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 06:27:35,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677452262] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:35,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:27:35,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-08-27 06:27:35,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89670867] [2021-08-27 06:27:35,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 06:27:35,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 06:27:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:27:35,373 INFO L87 Difference]: Start difference. First operand 185 states and 195 transitions. Second operand has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 14 states have internal predecessors, (82), 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 06:27:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:36,700 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2021-08-27 06:27:36,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:27:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 14 states have internal predecessors, (82), 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 48 [2021-08-27 06:27:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:36,701 INFO L225 Difference]: With dead ends: 240 [2021-08-27 06:27:36,701 INFO L226 Difference]: Without dead ends: 240 [2021-08-27 06:27:36,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 397.0ms TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:27:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-27 06:27:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 187. [2021-08-27 06:27:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 131 states have (on average 1.4198473282442747) internal successors, (186), 176 states have internal predecessors, (186), 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 06:27:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2021-08-27 06:27:36,706 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 48 [2021-08-27 06:27:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:36,706 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2021-08-27 06:27:36,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 14 states have internal predecessors, (82), 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 06:27:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2021-08-27 06:27:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:27:36,707 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:36,707 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] [2021-08-27 06:27:36,743 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 06:27:36,920 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 06:27:36,921 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting create_treeErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:27:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1808226346, now seen corresponding path program 1 times [2021-08-27 06:27:36,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:36,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515006564] [2021-08-27 06:27:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:36,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:37,240 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 06:27:37,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:37,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515006564] [2021-08-27 06:27:37,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515006564] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:37,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403551398] [2021-08-27 06:27:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:37,241 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:27:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:27:37,243 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 06:27:37,243 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 06:27:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:37,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-27 06:27:37,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:27:37,550 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 06:27:37,603 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:27:37,603 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 06:27:37,660 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 06:27:37,718 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-08-27 06:27:37,718 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 47 treesize of output 31 [2021-08-27 06:27:37,804 INFO L354 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-08-27 06:27:37,804 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 56 treesize of output 34 [2021-08-27 06:27:37,907 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-08-27 06:27:37,907 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 06:27:38,022 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-08-27 06:27:38,022 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 67 treesize of output 54 [2021-08-27 06:27:38,285 INFO L354 Elim1Store]: treesize reduction 124, result has 17.3 percent of original size [2021-08-27 06:27:38,285 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 64 [2021-08-27 06:27:38,550 INFO L354 Elim1Store]: treesize reduction 196, result has 14.4 percent of original size [2021-08-27 06:27:38,554 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 100 treesize of output 76 [2021-08-27 06:27:44,864 INFO L354 Elim1Store]: treesize reduction 226, result has 15.4 percent of original size [2021-08-27 06:27:44,865 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 112 treesize of output 90 [2021-08-27 06:27:45,058 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-08-27 06:27:45,058 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 66 [2021-08-27 06:27:45,178 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-08-27 06:27:45,178 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 95 treesize of output 43 [2021-08-27 06:27:45,412 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-08-27 06:27:45,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 42 [2021-08-27 06:27:45,497 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 06:27:45,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403551398] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:27:45,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:27:45,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-08-27 06:27:45,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128349406] [2021-08-27 06:27:45,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-27 06:27:45,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-27 06:27:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=767, Unknown=2, NotChecked=0, Total=930 [2021-08-27 06:27:45,499 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 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 06:28:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:07,816 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2021-08-27 06:28:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-27 06:28:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 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 48 [2021-08-27 06:28:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:07,818 INFO L225 Difference]: With dead ends: 270 [2021-08-27 06:28:07,818 INFO L226 Difference]: Without dead ends: 270 [2021-08-27 06:28:07,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 23609.0ms TimeCoverageRelationStatistics Valid=529, Invalid=2432, Unknown=9, NotChecked=0, Total=2970 [2021-08-27 06:28:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-08-27 06:28:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2021-08-27 06:28:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 179 states have internal predecessors, (191), 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 06:28:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 202 transitions. [2021-08-27 06:28:07,823 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 202 transitions. Word has length 48 [2021-08-27 06:28:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:07,823 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 202 transitions. [2021-08-27 06:28:07,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 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 06:28:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 202 transitions. [2021-08-27 06:28:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 06:28:07,824 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:07,824 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] [2021-08-27 06:28:07,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-27 06:28:08,033 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 06:28:08,033 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting create_treeErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:28:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1808226345, now seen corresponding path program 1 times [2021-08-27 06:28:08,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:08,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991710296] [2021-08-27 06:28:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:08,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,558 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 06:28:08,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:08,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991710296] [2021-08-27 06:28:08,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991710296] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:08,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442416050] [2021-08-27 06:28:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:08,559 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:08,562 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 06:28:08,563 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 06:28:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-27 06:28:08,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:08,951 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 06:28:08,956 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 06:28:09,066 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:28:09,066 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 06:28:09,084 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:28:09,084 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 06:28:09,169 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 06:28:09,173 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 06:28:09,287 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-08-27 06:28:09,287 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 54 [2021-08-27 06:28:09,300 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:28:09,301 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 78 treesize of output 71 [2021-08-27 06:28:09,448 INFO L354 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2021-08-27 06:28:09,448 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 72 [2021-08-27 06:28:09,465 INFO L354 Elim1Store]: treesize reduction 104, result has 18.1 percent of original size [2021-08-27 06:28:09,466 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 87 treesize of output 74 [2021-08-27 06:28:09,626 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-08-27 06:28:09,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-08-27 06:28:09,635 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 06:28:09,730 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-08-27 06:28:09,730 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 98 treesize of output 79 [2021-08-27 06:28:09,754 INFO L354 Elim1Store]: treesize reduction 84, result has 21.5 percent of original size [2021-08-27 06:28:09,754 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 99 treesize of output 101 [2021-08-27 06:28:10,034 INFO L354 Elim1Store]: treesize reduction 114, result has 17.4 percent of original size [2021-08-27 06:28:10,034 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 89 [2021-08-27 06:28:10,053 INFO L354 Elim1Store]: treesize reduction 108, result has 17.6 percent of original size [2021-08-27 06:28:10,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2021-08-27 06:28:10,371 INFO L354 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2021-08-27 06:28:10,372 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 152 treesize of output 110 [2021-08-27 06:28:10,412 INFO L354 Elim1Store]: treesize reduction 180, result has 15.9 percent of original size [2021-08-27 06:28:10,412 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 144 treesize of output 145 [2021-08-27 06:28:14,825 INFO L354 Elim1Store]: treesize reduction 214, result has 15.4 percent of original size [2021-08-27 06:28:14,826 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 176 treesize of output 132 [2021-08-27 06:28:14,860 INFO L354 Elim1Store]: treesize reduction 214, result has 16.4 percent of original size [2021-08-27 06:28:14,860 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 151 treesize of output 135 [2021-08-27 06:28:15,068 INFO L354 Elim1Store]: treesize reduction 126, result has 16.0 percent of original size [2021-08-27 06:28:15,069 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 93 [2021-08-27 06:28:15,087 INFO L354 Elim1Store]: treesize reduction 116, result has 16.5 percent of original size [2021-08-27 06:28:15,088 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 122 treesize of output 120 [2021-08-27 06:28:15,271 INFO L354 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2021-08-27 06:28:15,271 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 137 treesize of output 77 [2021-08-27 06:28:15,278 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:28:15,279 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 67 treesize of output 42 [2021-08-27 06:28:15,453 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-08-27 06:28:15,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 42 [2021-08-27 06:28:15,514 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 06:28:15,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442416050] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:15,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:28:15,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-08-27 06:28:15,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838468301] [2021-08-27 06:28:15,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-08-27 06:28:15,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:15,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-08-27 06:28:15,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=928, Unknown=2, NotChecked=0, Total=1056 [2021-08-27 06:28:15,522 INFO L87 Difference]: Start difference. First operand 190 states and 202 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 states have internal predecessors, (79), 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 06:28:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:19,356 INFO L93 Difference]: Finished difference Result 264 states and 279 transitions. [2021-08-27 06:28:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 06:28:19,357 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 states have internal predecessors, (79), 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 48 [2021-08-27 06:28:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:19,358 INFO L225 Difference]: With dead ends: 264 [2021-08-27 06:28:19,358 INFO L226 Difference]: Without dead ends: 264 [2021-08-27 06:28:19,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 6468.7ms TimeCoverageRelationStatistics Valid=554, Invalid=2750, Unknown=2, NotChecked=0, Total=3306 [2021-08-27 06:28:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-08-27 06:28:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 205. [2021-08-27 06:28:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 194 states have internal predecessors, (211), 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 06:28:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 222 transitions. [2021-08-27 06:28:19,366 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 222 transitions. Word has length 48 [2021-08-27 06:28:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:19,367 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 222 transitions. [2021-08-27 06:28:19,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 32 states have internal predecessors, (79), 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 06:28:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 222 transitions. [2021-08-27 06:28:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 06:28:19,368 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:19,368 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 06:28:19,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:19,580 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 06:28:19,581 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting inspectErr7REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:28:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1153112958, now seen corresponding path program 1 times [2021-08-27 06:28:19,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:19,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914440212] [2021-08-27 06:28:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:19,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:19,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:28:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:19,866 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 06:28:19,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:19,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914440212] [2021-08-27 06:28:19,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914440212] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:19,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307592113] [2021-08-27 06:28:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:19,867 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:19,869 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 06:28:19,892 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 06:28:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:20,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-27 06:28:20,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:20,424 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-08-27 06:28:20,425 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 06:28:21,158 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:28:21,159 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 06:28:21,442 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-08-27 06:28:21,442 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 06:28:21,767 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:28:21,768 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 06:28:21,804 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 06:28:21,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307592113] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:21,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:28:21,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2021-08-27 06:28:21,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949024996] [2021-08-27 06:28:21,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-27 06:28:21,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-27 06:28:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:28:21,806 INFO L87 Difference]: Start difference. First operand 205 states and 222 transitions. Second operand has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 22 states have internal predecessors, (88), 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 06:28:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:24,817 INFO L93 Difference]: Finished difference Result 307 states and 335 transitions. [2021-08-27 06:28:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 06:28:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 22 states have internal predecessors, (88), 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 50 [2021-08-27 06:28:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:24,819 INFO L225 Difference]: With dead ends: 307 [2021-08-27 06:28:24,819 INFO L226 Difference]: Without dead ends: 307 [2021-08-27 06:28:24,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1757.4ms TimeCoverageRelationStatistics Valid=314, Invalid=2548, Unknown=0, NotChecked=0, Total=2862 [2021-08-27 06:28:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-27 06:28:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 246. [2021-08-27 06:28:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 187 states have (on average 1.4331550802139037) internal successors, (268), 233 states have internal predecessors, (268), 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 06:28:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2021-08-27 06:28:24,828 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 50 [2021-08-27 06:28:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:24,829 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2021-08-27 06:28:24,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.142857142857143) internal successors, (88), 22 states have internal predecessors, (88), 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 06:28:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2021-08-27 06:28:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 06:28:24,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:24,830 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] [2021-08-27 06:28:24,849 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 06:28:25,033 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 06:28:25,033 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting inspectErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:28:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1386738628, now seen corresponding path program 1 times [2021-08-27 06:28:25,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:25,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939964815] [2021-08-27 06:28:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:25,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:28:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:25,563 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 06:28:25,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:25,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939964815] [2021-08-27 06:28:25,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939964815] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:25,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251145562] [2021-08-27 06:28:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:25,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:25,565 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 06:28:25,565 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 06:28:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:26,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-27 06:28:26,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:26,170 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 06:28:26,322 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:28:26,322 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 06:28:26,330 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:28:26,385 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 06:28:26,399 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 15 treesize of output 11 [2021-08-27 06:28:26,581 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:28:26,581 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 06:28:26,594 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:28:26,597 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 06:28:26,819 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:28:26,820 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 06:28:26,838 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 06:28:26,838 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 06:28:31,091 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 06:28:31,092 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 06:28:31,120 INFO L354 Elim1Store]: treesize reduction 98, result has 21.6 percent of original size [2021-08-27 06:28:31,121 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 06:28:31,260 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:28:31,260 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 79 treesize of output 61 [2021-08-27 06:28:31,273 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:28:31,273 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 71 treesize of output 62 [2021-08-27 06:28:32,221 INFO L354 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2021-08-27 06:28:32,222 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 83 treesize of output 64 [2021-08-27 06:28:32,232 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:28:32,233 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 55 treesize of output 39 [2021-08-27 06:28:32,275 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 06:28:32,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251145562] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:32,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:28:32,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2021-08-27 06:28:32,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636683592] [2021-08-27 06:28:32,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-27 06:28:32,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:32,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 06:28:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1301, Unknown=2, NotChecked=0, Total=1406 [2021-08-27 06:28:32,277 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 32 states have internal predecessors, (88), 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 06:28:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:35,673 INFO L93 Difference]: Finished difference Result 336 states and 381 transitions. [2021-08-27 06:28:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 06:28:35,673 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 32 states have internal predecessors, (88), 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 51 [2021-08-27 06:28:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:35,674 INFO L225 Difference]: With dead ends: 336 [2021-08-27 06:28:35,674 INFO L226 Difference]: Without dead ends: 336 [2021-08-27 06:28:35,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 6385.1ms TimeCoverageRelationStatistics Valid=351, Invalid=3187, Unknown=2, NotChecked=0, Total=3540 [2021-08-27 06:28:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-08-27 06:28:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 280. [2021-08-27 06:28:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 218 states have (on average 1.4357798165137614) internal successors, (313), 265 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 06:28:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 330 transitions. [2021-08-27 06:28:35,682 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 330 transitions. Word has length 51 [2021-08-27 06:28:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:35,683 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 330 transitions. [2021-08-27 06:28:35,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 32 states have internal predecessors, (88), 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 06:28:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 330 transitions. [2021-08-27 06:28:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 06:28:35,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:35,684 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] [2021-08-27 06:28:35,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-08-27 06:28:35,908 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 06:28:35,909 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting inspectErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:28:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1386738627, now seen corresponding path program 1 times [2021-08-27 06:28:35,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:35,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019472937] [2021-08-27 06:28:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:35,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:28:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:36,313 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 06:28:36,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:36,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019472937] [2021-08-27 06:28:36,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019472937] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:36,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500655717] [2021-08-27 06:28:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:36,313 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:36,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:36,314 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 06:28:36,316 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 06:28:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:36,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-27 06:28:36,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:36,992 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 06:28:37,130 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-08-27 06:28:37,130 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 06:28:37,178 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 06:28:37,358 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:28:37,358 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 37 treesize of output 27 [2021-08-27 06:28:37,540 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:28:37,540 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 50 treesize of output 39 [2021-08-27 06:28:43,744 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 06:28:43,748 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 06:28:43,851 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:28:43,851 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 06:28:44,446 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:28:44,446 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 49 treesize of output 33 [2021-08-27 06:28:44,501 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 06:28:44,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500655717] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:44,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:28:44,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2021-08-27 06:28:44,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308506069] [2021-08-27 06:28:44,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-08-27 06:28:44,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:44,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-27 06:28:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1279, Unknown=2, NotChecked=0, Total=1406 [2021-08-27 06:28:44,503 INFO L87 Difference]: Start difference. First operand 280 states and 330 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 32 states have internal predecessors, (88), 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 06:29:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:08,206 INFO L93 Difference]: Finished difference Result 332 states and 377 transitions. [2021-08-27 06:29:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 06:29:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 32 states have internal predecessors, (88), 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 51 [2021-08-27 06:29:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:08,208 INFO L225 Difference]: With dead ends: 332 [2021-08-27 06:29:08,208 INFO L226 Difference]: Without dead ends: 332 [2021-08-27 06:29:08,209 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 24161.9ms TimeCoverageRelationStatistics Valid=424, Invalid=3599, Unknown=9, NotChecked=0, Total=4032 [2021-08-27 06:29:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-08-27 06:29:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 280. [2021-08-27 06:29:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 218 states have (on average 1.426605504587156) internal successors, (311), 265 states have internal predecessors, (311), 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 06:29:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2021-08-27 06:29:08,215 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 51 [2021-08-27 06:29:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:08,215 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2021-08-27 06:29:08,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 32 states have internal predecessors, (88), 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 06:29:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2021-08-27 06:29:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 06:29:08,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:08,218 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] [2021-08-27 06:29:08,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:08,434 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 06:29:08,434 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash -959847044, now seen corresponding path program 1 times [2021-08-27 06:29:08,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:08,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256287420] [2021-08-27 06:29:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:08,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:29:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 06:29:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,037 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 06:29:09,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:29:09,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256287420] [2021-08-27 06:29:09,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256287420] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:09,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776421286] [2021-08-27 06:29:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:09,038 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:29:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:09,039 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 06:29:09,040 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 06:29:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:09,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 53 conjunts are in the unsatisfiable core [2021-08-27 06:29:09,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:09,802 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 06:29:09,955 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:29:09,956 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 06:29:09,994 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 06:29:10,122 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:29:10,122 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 06:29:10,284 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:29:10,284 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 06:29:16,532 INFO L354 Elim1Store]: treesize reduction 94, result has 22.3 percent of original size [2021-08-27 06:29:16,532 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 06:29:16,536 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 06:29:16,551 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-08-27 06:29:16,551 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 06:29:16,769 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:29:16,769 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 06:29:16,782 INFO L354 Elim1Store]: treesize reduction 53, result has 24.3 percent of original size [2021-08-27 06:29:16,783 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 70 [2021-08-27 06:29:16,795 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:29:16,796 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 58 [2021-08-27 06:29:17,618 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:29:17,619 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 06:29:17,630 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-08-27 06:29:17,630 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 06:29:17,672 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 06:29:17,679 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 06:29:17,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776421286] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:29:17,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:17,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2021-08-27 06:29:17,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693461580] [2021-08-27 06:29:17,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-08-27 06:29:17,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:29:17,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-08-27 06:29:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1530, Unknown=2, NotChecked=0, Total=1640 [2021-08-27 06:29:17,681 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 35 states have internal predecessors, (90), 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 06:29:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:42,279 INFO L93 Difference]: Finished difference Result 334 states and 376 transitions. [2021-08-27 06:29:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 06:29:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 35 states have internal predecessors, (90), 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 54 [2021-08-27 06:29:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:42,281 INFO L225 Difference]: With dead ends: 334 [2021-08-27 06:29:42,282 INFO L226 Difference]: Without dead ends: 334 [2021-08-27 06:29:42,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 24875.9ms TimeCoverageRelationStatistics Valid=412, Invalid=4001, Unknown=9, NotChecked=0, Total=4422 [2021-08-27 06:29:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-08-27 06:29:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 280. [2021-08-27 06:29:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 218 states have (on average 1.4174311926605505) internal successors, (309), 265 states have internal predecessors, (309), 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 06:29:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 326 transitions. [2021-08-27 06:29:42,288 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 326 transitions. Word has length 54 [2021-08-27 06:29:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:42,288 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 326 transitions. [2021-08-27 06:29:42,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 35 states have internal predecessors, (90), 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 06:29:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 326 transitions. [2021-08-27 06:29:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 06:29:42,289 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:42,289 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] [2021-08-27 06:29:42,319 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 06:29:42,501 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 06:29:42,501 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1058233124, now seen corresponding path program 1 times [2021-08-27 06:29:42,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:29:42,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058419213] [2021-08-27 06:29:42,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:42,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:29:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:29:42,522 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:29:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:29:42,566 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:29:42,566 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:29:42,567 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr0REQUIRES_VIOLATION [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr1REQUIRES_VIOLATION [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr2REQUIRES_VIOLATION [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr3REQUIRES_VIOLATION [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr4REQUIRES_VIOLATION [2021-08-27 06:29:42,569 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr5REQUIRES_VIOLATION [2021-08-27 06:29:42,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr6REQUIRES_VIOLATION [2021-08-27 06:29:42,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr7REQUIRES_VIOLATION [2021-08-27 06:29:42,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr8REQUIRES_VIOLATION [2021-08-27 06:29:42,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr9REQUIRES_VIOLATION [2021-08-27 06:29:42,570 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr10REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr11REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr12REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr13REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr14REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr15REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr16REQUIRES_VIOLATION [2021-08-27 06:29:42,571 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr17REQUIRES_VIOLATION [2021-08-27 06:29:42,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr18REQUIRES_VIOLATION [2021-08-27 06:29:42,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr19REQUIRES_VIOLATION [2021-08-27 06:29:42,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr20REQUIRES_VIOLATION [2021-08-27 06:29:42,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr21REQUIRES_VIOLATION [2021-08-27 06:29:42,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr22REQUIRES_VIOLATION [2021-08-27 06:29:42,572 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr23REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr24REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr25REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr26REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr27REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr0REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr1REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr2REQUIRES_VIOLATION [2021-08-27 06:29:42,573 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr3REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr4REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr5REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr6REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr7REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr8REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr9REQUIRES_VIOLATION [2021-08-27 06:29:42,574 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr0REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr1REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr2REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr3REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr4REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr5REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr6REQUIRES_VIOLATION [2021-08-27 06:29:42,575 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr7REQUIRES_VIOLATION [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr9ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr10ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr11REQUIRES_VIOLATION [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr12REQUIRES_VIOLATION [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr13REQUIRES_VIOLATION [2021-08-27 06:29:42,576 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr14REQUIRES_VIOLATION [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr15ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr16ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr17ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr18REQUIRES_VIOLATION [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr19REQUIRES_VIOLATION [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr20ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,577 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr21ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr22ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:29:42,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 06:29:42,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:29:42,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:29:42 BoogieIcfgContainer [2021-08-27 06:29:42,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:29:42,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:29:42,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:29:42,636 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:29:42,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:26:53" (3/4) ... [2021-08-27 06:29:42,640 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:29:42,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:29:42,640 INFO L168 Benchmark]: Toolchain (without parser) took 170485.15 ms. Allocated memory was 54.5 MB in the beginning and 302.0 MB in the end (delta: 247.5 MB). Free memory was 31.3 MB in the beginning and 81.1 MB in the end (delta: -49.8 MB). Peak memory consumption was 197.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:29:42,641 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 36.0 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:29:42,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.50 ms. Allocated memory is still 54.5 MB. Free memory was 31.1 MB in the beginning and 30.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:29:42,641 INFO L168 Benchmark]: Boogie Preprocessor took 93.09 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 26.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:29:42,642 INFO L168 Benchmark]: RCFGBuilder took 785.72 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 26.8 MB in the beginning and 43.1 MB in the end (delta: -16.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:29:42,642 INFO L168 Benchmark]: TraceAbstraction took 169216.87 ms. Allocated memory was 67.1 MB in the beginning and 302.0 MB in the end (delta: 234.9 MB). Free memory was 42.8 MB in the beginning and 82.2 MB in the end (delta: -39.4 MB). Peak memory consumption was 196.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:29:42,643 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 302.0 MB. Free memory was 82.2 MB in the beginning and 81.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:29:42,644 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.21 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 36.0 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 378.50 ms. Allocated memory is still 54.5 MB. Free memory was 31.1 MB in the beginning and 30.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.09 ms. Allocated memory is still 54.5 MB. Free memory was 30.0 MB in the beginning and 26.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 785.72 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 26.8 MB in the beginning and 43.1 MB in the end (delta: -16.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 169216.87 ms. Allocated memory was 67.1 MB in the beginning and 302.0 MB in the end (delta: 234.9 MB). Free memory was 42.8 MB in the beginning and 82.2 MB in the end (delta: -39.4 MB). Peak memory consumption was 196.4 MB. Max. memory is 16.1 GB. * Witness Printer took 4.04 ms. Allocated memory is still 302.0 MB. Free memory was 82.2 MB in the beginning and 81.1 MB in the end (delta: 1.0 MB). There was no memory consumed. 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 - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 565. Possible FailurePath: [L630] 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) [L600] node->left = malloc(sizeof *node) VAL [malloc(sizeof *node)={-2:0}, node={-1:0}, nodelast={-1:0}, value=0] [L601] COND FALSE !(!node) VAL [node={-1:0}, nodelast={-1:0}, value=0] [L603] EXPR node->left VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L603] node->left->left = ((void *)0) VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L604] EXPR node->left VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L604] node->left->right = ((void *)0) VAL [node={-1:0}, node->left={-2: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->value = 42 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->parent = node VAL [node={-1:0}, node->left={-2:0}, nodelast={-1:0}, value=0] [L607] EXPR node->right VAL [node={-1:0}, node->right={0:0}, nodelast={-1:0}, value=0] [L607] node = node->right [L599] COND FALSE !(node != ((void *)0)) VAL [node={0:0}, nodelast={-1:0}, value=0] [L609] return nodelast; VAL [\result={-1:0}, node={0:0}, nodelast={-1:0}, value=0] [L630] RET, EXPR create_tree() VAL [create_tree()={-1:0}] [L630] struct node *data = create_tree(); [L631] COND FALSE !(!data) VAL [data={-1:0}] [L633] 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: 628]: 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: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: 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: 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: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: 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: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that free always succeeds Unable to prove that free 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: 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: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: 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, 169 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 169112.8ms, OverallIterations: 29, TraceHistogramMax: 3, EmptinessCheckTime: 32.3ms, AutomataDifference: 112457.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2471 SDtfs, 6333 SDslu, 6226 SDs, 0 SdLazy, 33458 SolverSat, 769 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 35778.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 488 SyntacticMatches, 3 SemanticMatches, 595 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4662 ImplicationChecksByTransitivity, 108492.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=26, InterpolantAutomatonStates: 381, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 187.0ms AutomataMinimizationTime, 28 MinimizatonAttempts, 1321 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 173.7ms SsaConstructionTime, 641.3ms SatisfiabilityAnalysisTime, 49150.1ms InterpolantComputationTime, 1441 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1345 ConstructedInterpolants, 157 QuantifiedInterpolants, 21169 SizeOfPredicates, 142 NumberOfNonLiveVariables, 2772 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 88/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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:29:42,698 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:29:44,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:29:44,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:29:44,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:29:44,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:29:44,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:29:44,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:29:44,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:29:44,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:29:44,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:29:44,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:29:44,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:29:44,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:29:44,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:29:44,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:29:44,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:29:44,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:29:44,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:29:44,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:29:44,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:29:44,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:29:44,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:29:44,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:29:44,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:29:44,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:29:44,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:29:44,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:29:44,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:29:44,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:29:44,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:29:44,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:29:44,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:29:44,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:29:44,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:29:44,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:29:44,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:29:44,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:29:44,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:29:44,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:29:44,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:29:44,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:29:44,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:29:44,740 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:29:44,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:29:44,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:29:44,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:29:44,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:29:44,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:29:44,744 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:29:44,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:29:44,745 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:29:44,745 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:29:44,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:29:44,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:29:44,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:29:44,746 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:29:44,746 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:29:44,747 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:29:44,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:29:44,747 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:29:44,747 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:29:44,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:29:44,747 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:29:44,748 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:29:44,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:29:44,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:29:44,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:29:44,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:29:44,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:29:44,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:29:44,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:29:44,749 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:29:44,749 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:29:44,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:29:44,750 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8850e617230fbb23d096e299440f36502352977 [2021-08-27 06:29:45,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:29:45,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:29:45,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:29:45,135 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:29:45,135 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:29:45,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-2.i [2021-08-27 06:29:45,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f6896ae/62a2632cd1d749d7bbe50dc42ecc5786/FLAG3788a4bb9 [2021-08-27 06:29:45,716 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:29:45,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-2.i [2021-08-27 06:29:45,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f6896ae/62a2632cd1d749d7bbe50dc42ecc5786/FLAG3788a4bb9 [2021-08-27 06:29:46,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f6896ae/62a2632cd1d749d7bbe50dc42ecc5786 [2021-08-27 06:29:46,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:29:46,175 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:29:46,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:29:46,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:29:46,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:29:46,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6623683a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46, skipping insertion in model container [2021-08-27 06:29:46,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:29:46,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:29:46,464 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-2.i[22626,22639] [2021-08-27 06:29:46,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:29:46,495 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:29:46,525 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-2.i[22626,22639] [2021-08-27 06:29:46,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:29:46,577 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:29:46,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46 WrapperNode [2021-08-27 06:29:46,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:29:46,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:29:46,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:29:46,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:29:46,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:29:46,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:29:46,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:29:46,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:29:46,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (1/1) ... [2021-08-27 06:29:46,702 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:29:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:29:46,722 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 06:29:46,751 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 06:29:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:29:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:29:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:29:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:29:46,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 06:29:46,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 06:29:46,773 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-27 06:29:46,773 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-08-27 06:29:46,774 INFO L138 BoogieDeclarations]: Found implementation of procedure create_tree [2021-08-27 06:29:46,774 INFO L138 BoogieDeclarations]: Found implementation of procedure free_tree [2021-08-27 06:29:46,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:29:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:29:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:29:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:29:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:29:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:29:46,790 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:29:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:29:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:29:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:29:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:29:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:29:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:29:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:29:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:29:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:29:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:29:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:29:46,792 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:29:46,793 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:29:46,794 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:29:46,794 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:29:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:29:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:29:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:29:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:29:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:29:46,795 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:29:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:29:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:29:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:29:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:29:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:29:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:29:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:29:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:29:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:29:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:29:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:29:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:29:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:29:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:29:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:29:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:29:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:29:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:29:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:29:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:29:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:29:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:29:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:29:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:29:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:29:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:29:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:29:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:29:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:29:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:29:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:29:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:29:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:29:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:29:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:29:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:29:46,807 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:29:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:29:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:29:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-27 06:29:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-08-27 06:29:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:29:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:29:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure create_tree [2021-08-27 06:29:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:29:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:29:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:29:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure free_tree [2021-08-27 06:29:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:29:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:29:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:29:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:29:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:29:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:29:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:29:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:29:48,027 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:29:48,028 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-08-27 06:29:48,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:48 BoogieIcfgContainer [2021-08-27 06:29:48,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:29:48,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:29:48,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:29:48,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:29:48,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:29:46" (1/3) ... [2021-08-27 06:29:48,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5d0f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:29:48, skipping insertion in model container [2021-08-27 06:29:48,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:29:46" (2/3) ... [2021-08-27 06:29:48,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5d0f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:29:48, skipping insertion in model container [2021-08-27 06:29:48,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:48" (3/3) ... [2021-08-27 06:29:48,063 INFO L111 eAbstractionObserver]: Analyzing ICFG tree-2.i [2021-08-27 06:29:48,068 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:29:48,068 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2021-08-27 06:29:48,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:29:48,108 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 06:29:48,109 INFO L340 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2021-08-27 06:29:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 81 states have (on average 2.111111111111111) internal successors, (171), 147 states have internal predecessors, (171), 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 06:29:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:29:48,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:48,130 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:48,130 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting create_treeErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1922567749, now seen corresponding path program 1 times [2021-08-27 06:29:48,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:48,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687884882] [2021-08-27 06:29:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:48,146 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:48,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:48,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:48,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:29:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:48,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-27 06:29:48,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:48,549 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 06:29:48,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:48,625 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 06:29:48,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:48,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687884882] [2021-08-27 06:29:48,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687884882] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:48,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:48,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:29:48,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310408685] [2021-08-27 06:29:48,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 06:29:48,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 06:29:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 06:29:48,652 INFO L87 Difference]: Start difference. First operand has 159 states, 81 states have (on average 2.111111111111111) internal successors, (171), 147 states have internal predecessors, (171), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:48,683 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-08-27 06:29:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 06:29:48,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:48,694 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:29:48,695 INFO L226 Difference]: Without dead ends: 154 [2021-08-27 06:29:48,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 06:29:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-27 06:29:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-08-27 06:29:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 143 states have internal predecessors, (153), 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 06:29:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2021-08-27 06:29:48,748 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 10 [2021-08-27 06:29:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:48,749 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2021-08-27 06:29:48,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2021-08-27 06:29:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:29:48,750 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:48,750 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:48,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-27 06:29:48,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:48,960 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting create_treeErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1922596579, now seen corresponding path program 1 times [2021-08-27 06:29:48,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:48,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131292954] [2021-08-27 06:29:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:48,962 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:48,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:48,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:29:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:49,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:29:49,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:49,301 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 06:29:49,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:49,385 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 06:29:49,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:49,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131292954] [2021-08-27 06:29:49,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131292954] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:49,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:49,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:29:49,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709286473] [2021-08-27 06:29:49,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:29:49,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:29:49,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:49,395 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:49,538 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2021-08-27 06:29:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:29:49,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:49,540 INFO L225 Difference]: With dead ends: 156 [2021-08-27 06:29:49,540 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 06:29:49,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 06:29:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-08-27 06:29:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 145 states have internal predecessors, (156), 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 06:29:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2021-08-27 06:29:49,554 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 10 [2021-08-27 06:29:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:49,555 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2021-08-27 06:29:49,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2021-08-27 06:29:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:29:49,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:49,556 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:49,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:49,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:49,765 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting create_treeErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1922595681, now seen corresponding path program 1 times [2021-08-27 06:29:49,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:49,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890791908] [2021-08-27 06:29:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:49,767 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:49,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:49,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:29:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:49,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:29:49,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:49,967 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 06:29:49,978 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 06:29:49,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:50,018 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 06:29:50,018 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:50,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890791908] [2021-08-27 06:29:50,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890791908] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:50,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:50,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:29:50,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703567670] [2021-08-27 06:29:50,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:29:50,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:29:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:50,021 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:50,226 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2021-08-27 06:29:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:29:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:50,229 INFO L225 Difference]: With dead ends: 154 [2021-08-27 06:29:50,229 INFO L226 Difference]: Without dead ends: 154 [2021-08-27 06:29:50,230 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-27 06:29:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2021-08-27 06:29:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.8313253012048192) internal successors, (152), 139 states have internal predecessors, (152), 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 06:29:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2021-08-27 06:29:50,237 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 10 [2021-08-27 06:29:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:50,238 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2021-08-27 06:29:50,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 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 06:29:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2021-08-27 06:29:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:29:50,238 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:50,239 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:50,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-27 06:29:50,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:50,447 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting create_treeErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1922595680, now seen corresponding path program 1 times [2021-08-27 06:29:50,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:50,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978222431] [2021-08-27 06:29:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:50,449 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:50,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:50,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:29:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:50,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:29:50,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:50,647 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 06:29:50,673 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 06:29:50,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:50,765 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 06:29:50,766 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:50,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978222431] [2021-08-27 06:29:50,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978222431] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:50,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:50,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:29:50,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360541971] [2021-08-27 06:29:50,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:29:50,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:29:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:50,768 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 06:29:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:51,173 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2021-08-27 06:29:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:29:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 06:29:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:51,175 INFO L225 Difference]: With dead ends: 170 [2021-08-27 06:29:51,175 INFO L226 Difference]: Without dead ends: 170 [2021-08-27 06:29:51,176 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:51,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-27 06:29:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2021-08-27 06:29:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7040816326530612) internal successors, (167), 147 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 06:29:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2021-08-27 06:29:51,183 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 10 [2021-08-27 06:29:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:51,183 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2021-08-27 06:29:51,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 06:29:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2021-08-27 06:29:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:29:51,184 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:51,184 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:51,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:51,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:51,393 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting create_treeErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1635962694, now seen corresponding path program 1 times [2021-08-27 06:29:51,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:51,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877396462] [2021-08-27 06:29:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:51,394 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:51,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:51,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:51,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:29:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:51,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:29:51,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:51,636 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 06:29:51,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:51,737 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 06:29:51,737 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:51,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877396462] [2021-08-27 06:29:51,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877396462] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:51,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:51,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:29:51,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572376922] [2021-08-27 06:29:51,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:29:51,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:29:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:51,740 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 06:29:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:51,774 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2021-08-27 06:29:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:29:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 13 [2021-08-27 06:29:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:51,776 INFO L225 Difference]: With dead ends: 168 [2021-08-27 06:29:51,777 INFO L226 Difference]: Without dead ends: 168 [2021-08-27 06:29:51,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-27 06:29:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2021-08-27 06:29:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 102 states have (on average 1.6764705882352942) internal successors, (171), 151 states have internal predecessors, (171), 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 06:29:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2021-08-27 06:29:51,783 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 13 [2021-08-27 06:29:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:51,783 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2021-08-27 06:29:51,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 1 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 06:29:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2021-08-27 06:29:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:29:51,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:51,784 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:51,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:51,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:51,994 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash -176773903, now seen corresponding path program 1 times [2021-08-27 06:29:51,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:51,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68179697] [2021-08-27 06:29:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:51,995 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:51,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:51,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:51,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:29:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:52,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:29:52,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:52,198 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 06:29:52,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:52,262 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 06:29:52,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:52,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68179697] [2021-08-27 06:29:52,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68179697] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:52,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:52,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:29:52,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050069562] [2021-08-27 06:29:52,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:29:52,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:29:52,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:52,265 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:29:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:52,447 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2021-08-27 06:29:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:29:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2021-08-27 06:29:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:52,449 INFO L225 Difference]: With dead ends: 208 [2021-08-27 06:29:52,449 INFO L226 Difference]: Without dead ends: 207 [2021-08-27 06:29:52,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-08-27 06:29:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 167. [2021-08-27 06:29:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.650943396226415) internal successors, (175), 155 states have internal predecessors, (175), 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 06:29:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2021-08-27 06:29:52,457 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 15 [2021-08-27 06:29:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:52,457 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2021-08-27 06:29:52,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:29:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2021-08-27 06:29:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:29:52,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:52,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:52,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:52,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:52,669 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1873470915, now seen corresponding path program 1 times [2021-08-27 06:29:52,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:52,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942928158] [2021-08-27 06:29:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:52,670 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:52,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:52,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:52,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:29:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:52,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:29:52,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:52,964 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 06:29:52,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:53,136 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 06:29:53,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:53,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942928158] [2021-08-27 06:29:53,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942928158] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:53,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:53,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 06:29:53,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916434014] [2021-08-27 06:29:53,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:29:53,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:29:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:29:53,139 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 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 06:29:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:53,204 INFO L93 Difference]: Finished difference Result 172 states and 191 transitions. [2021-08-27 06:29:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:29:53,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 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 19 [2021-08-27 06:29:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:53,207 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:29:53,207 INFO L226 Difference]: Without dead ends: 166 [2021-08-27 06:29:53,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.3ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:29:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-27 06:29:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2021-08-27 06:29:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.6732673267326732) internal successors, (169), 150 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 06:29:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2021-08-27 06:29:53,212 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 19 [2021-08-27 06:29:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:53,213 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2021-08-27 06:29:53,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 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 06:29:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2021-08-27 06:29:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:29:53,213 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:53,214 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:53,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:53,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:53,421 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_treeErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1375470061, now seen corresponding path program 1 times [2021-08-27 06:29:53,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:53,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018436315] [2021-08-27 06:29:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:53,422 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:53,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:53,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:29:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:53,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:29:53,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:53,652 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 06:29:53,720 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:29:53,720 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 15 treesize of output 20 [2021-08-27 06:29:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:53,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:53,844 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:53,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018436315] [2021-08-27 06:29:53,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018436315] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:29:53,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:53,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-08-27 06:29:53,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826862042] [2021-08-27 06:29:53,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:29:53,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:29:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:29:53,847 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 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 06:29:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:54,084 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2021-08-27 06:29:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:29:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 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 21 [2021-08-27 06:29:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:54,086 INFO L225 Difference]: With dead ends: 166 [2021-08-27 06:29:54,086 INFO L226 Difference]: Without dead ends: 166 [2021-08-27 06:29:54,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-27 06:29:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2021-08-27 06:29:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.6633663366336633) internal successors, (168), 149 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 06:29:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2021-08-27 06:29:54,091 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 21 [2021-08-27 06:29:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:54,091 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2021-08-27 06:29:54,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 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 06:29:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2021-08-27 06:29:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:29:54,092 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:54,092 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:29:54,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:54,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:54,297 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_treeErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1375470060, now seen corresponding path program 1 times [2021-08-27 06:29:54,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:54,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061541903] [2021-08-27 06:29:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:54,299 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:54,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:54,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:54,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:29:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:54,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:29:54,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:54,553 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 06:29:54,658 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:29:54,659 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 06:29:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:54,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:55,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:55,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061541903] [2021-08-27 06:29:55,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061541903] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:29:55,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:29:55,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2021-08-27 06:29:55,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048147935] [2021-08-27 06:29:55,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:29:55,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:29:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:29:55,093 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 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 06:29:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:55,700 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2021-08-27 06:29:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:29:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 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 21 [2021-08-27 06:29:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:55,702 INFO L225 Difference]: With dead ends: 174 [2021-08-27 06:29:55,702 INFO L226 Difference]: Without dead ends: 174 [2021-08-27 06:29:55,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 185.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-27 06:29:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 159. [2021-08-27 06:29:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 148 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 06:29:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2021-08-27 06:29:55,707 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 21 [2021-08-27 06:29:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:55,707 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2021-08-27 06:29:55,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 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 06:29:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2021-08-27 06:29:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:29:55,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:55,708 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, 1] [2021-08-27 06:29:55,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:55,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:55,918 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_treeErr12REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -519189929, now seen corresponding path program 1 times [2021-08-27 06:29:55,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:55,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946723161] [2021-08-27 06:29:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:55,920 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:55,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:55,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:55,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:29:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:56,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:29:56,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:56,203 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 06:29:56,218 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 19 treesize of output 15 [2021-08-27 06:29:56,245 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 11 [2021-08-27 06:29:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:56,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:56,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:56,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946723161] [2021-08-27 06:29:56,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946723161] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:56,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:56,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:29:56,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772131757] [2021-08-27 06:29:56,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:29:56,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:29:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:29:56,331 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 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 06:29:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:56,616 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2021-08-27 06:29:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:29:56,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 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 22 [2021-08-27 06:29:56,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:56,618 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:29:56,618 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 06:29:56,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:29:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 06:29:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-08-27 06:29:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 101 states have (on average 1.6336633663366336) internal successors, (165), 147 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 06:29:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2021-08-27 06:29:56,622 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 22 [2021-08-27 06:29:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:56,623 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2021-08-27 06:29:56,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 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 06:29:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2021-08-27 06:29:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:29:56,624 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:56,624 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, 1] [2021-08-27 06:29:56,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:56,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:56,834 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_treeErr13REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash -519189928, now seen corresponding path program 1 times [2021-08-27 06:29:56,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:56,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822334966] [2021-08-27 06:29:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:56,835 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:56,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:56,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:29:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:57,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:29:57,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:57,128 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 06:29:57,149 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 17 treesize of output 13 [2021-08-27 06:29:57,157 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 06:29:57,203 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 31 treesize of output 23 [2021-08-27 06:29:57,211 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 20 treesize of output 12 [2021-08-27 06:29:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:57,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:29:57,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:57,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822334966] [2021-08-27 06:29:57,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822334966] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:57,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:57,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:29:57,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733974050] [2021-08-27 06:29:57,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:29:57,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:29:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:29:57,454 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (3), 1 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 06:29:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:58,257 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2021-08-27 06:29:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:29:58,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (3), 1 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 22 [2021-08-27 06:29:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:58,259 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:29:58,259 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:29:58,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 139.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:29:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:29:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 06:29:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.613861386138614) internal successors, (163), 146 states have internal predecessors, (163), 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 06:29:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2021-08-27 06:29:58,263 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 22 [2021-08-27 06:29:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:58,264 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2021-08-27 06:29:58,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (3), 1 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 06:29:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2021-08-27 06:29:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:29:58,265 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:58,265 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, 1, 1] [2021-08-27 06:29:58,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:58,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:58,475 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash 644306046, now seen corresponding path program 1 times [2021-08-27 06:29:58,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:58,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629987023] [2021-08-27 06:29:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:58,477 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:58,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:58,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:29:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:58,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:29:58,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:58,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:58,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:58,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629987023] [2021-08-27 06:29:58,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629987023] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:58,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:58,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:29:58,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895167433] [2021-08-27 06:29:58,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:29:58,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:29:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:58,879 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 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 06:29:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:29:58,974 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-08-27 06:29:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:29:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 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 23 [2021-08-27 06:29:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:29:58,976 INFO L225 Difference]: With dead ends: 164 [2021-08-27 06:29:58,976 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 06:29:58,976 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:29:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 06:29:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2021-08-27 06:29:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.603960396039604) internal successors, (162), 146 states have internal predecessors, (162), 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 06:29:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2021-08-27 06:29:58,980 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 23 [2021-08-27 06:29:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:29:58,980 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2021-08-27 06:29:58,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 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 06:29:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2021-08-27 06:29:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:29:58,981 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:29:58,981 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, 1, 1, 1, 1] [2021-08-27 06:29:58,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:29:59,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:29:59,190 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_treeErr16REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:29:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:29:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1009862468, now seen corresponding path program 1 times [2021-08-27 06:29:59,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:29:59,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783780069] [2021-08-27 06:29:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:29:59,191 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:29:59,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:29:59,193 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:29:59,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:29:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:29:59,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:29:59,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:29:59,497 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 06:29:59,572 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:29:59,573 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 20 treesize of output 27 [2021-08-27 06:29:59,631 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 23 treesize of output 19 [2021-08-27 06:29:59,796 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:29:59,797 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 06:29:59,888 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:29:59,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 35 [2021-08-27 06:29:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:29:59,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:04,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|create_tree_#t~mem14.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |create_tree_#t~mem14.offset| (_ bv0 32)))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))) (_ bv1 1)))) is different from false [2021-08-27 06:30:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:05,034 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:30:05,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783780069] [2021-08-27 06:30:05,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783780069] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:30:05,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:30:05,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-27 06:30:05,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503551762] [2021-08-27 06:30:05,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:30:05,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:30:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:30:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=114, Unknown=3, NotChecked=22, Total=182 [2021-08-27 06:30:05,038 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (3), 1 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 06:30:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:10,505 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-08-27 06:30:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:30:10,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (3), 1 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 25 [2021-08-27 06:30:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:10,506 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:30:10,506 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 06:30:10,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 5317.1ms TimeCoverageRelationStatistics Valid=95, Invalid=248, Unknown=3, NotChecked=34, Total=380 [2021-08-27 06:30:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 06:30:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2021-08-27 06:30:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5940594059405941) internal successors, (161), 146 states have internal predecessors, (161), 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 06:30:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2021-08-27 06:30:10,511 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 25 [2021-08-27 06:30:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:10,511 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2021-08-27 06:30:10,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (3), 1 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 06:30:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2021-08-27 06:30:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:30:10,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:10,512 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, 1, 1, 1, 1] [2021-08-27 06:30:10,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:10,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:30:10,722 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_treeErr17REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:30:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1009862467, now seen corresponding path program 1 times [2021-08-27 06:30:10,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:30:10,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891404687] [2021-08-27 06:30:10,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:10,724 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:30:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:30:10,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:30:10,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:30:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:11,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:30:11,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:11,079 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 06:30:11,125 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 06:30:11,137 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:11,138 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 14 treesize of output 14 [2021-08-27 06:30:11,164 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 06:30:11,171 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 06:30:11,303 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:30:11,303 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 06:30:11,321 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:30:11,321 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 06:30:11,415 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:30:11,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:30:11,423 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:30:11,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2021-08-27 06:30:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:11,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:16,016 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|create_tree_#t~mem14.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) |create_tree_#t~mem14.offset| (_ bv0 32)))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((|create_tree_#t~mem14.offset| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |create_tree_#t~mem14.offset| (_ bv0 32))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |create_tree_#t~mem14.offset| (_ bv0 32))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset)))))) is different from false [2021-08-27 06:30:16,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-08-27 06:30:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:16,468 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:30:16,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891404687] [2021-08-27 06:30:16,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891404687] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:30:16,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:30:16,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-27 06:30:16,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827071295] [2021-08-27 06:30:16,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:30:16,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:30:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:30:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=123, Unknown=2, NotChecked=22, Total=182 [2021-08-27 06:30:16,470 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (3), 1 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 06:30:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:18,082 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2021-08-27 06:30:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:30:18,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (3), 1 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 25 [2021-08-27 06:30:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:18,083 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:30:18,084 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:30:18,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 5132.2ms TimeCoverageRelationStatistics Valid=111, Invalid=353, Unknown=2, NotChecked=40, Total=506 [2021-08-27 06:30:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:30:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 06:30:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 146 states have internal predecessors, (160), 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 06:30:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2021-08-27 06:30:18,088 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 25 [2021-08-27 06:30:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:18,088 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2021-08-27 06:30:18,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (3), 1 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 06:30:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2021-08-27 06:30:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:30:18,089 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:18,089 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:30:18,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:18,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:30:18,300 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_treeErr20REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:30:18,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1433210718, now seen corresponding path program 1 times [2021-08-27 06:30:18,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:30:18,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121041512] [2021-08-27 06:30:18,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:18,301 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:30:18,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:30:18,302 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:30:18,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:30:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:18,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:30:18,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:18,702 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 06:30:18,796 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:30:18,796 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 23 treesize of output 30 [2021-08-27 06:30:18,837 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 23 treesize of output 19 [2021-08-27 06:30:18,956 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:30:18,956 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 06:30:19,099 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:30:19,099 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 52 treesize of output 41 [2021-08-27 06:30:23,204 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:30:23,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2021-08-27 06:30:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:23,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:25,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((|create_tree_#t~mem15.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_tree_#t~mem15.base| (store (select |c_#memory_$Pointer$.base| |c_create_tree_#t~mem15.base|) (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|) (_ bv0 32))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset)))))))) (_ bv1 1)))) is different from false [2021-08-27 06:30:29,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_create_tree_#t~mem14.base| (store (select |c_#memory_$Pointer$.base| |c_create_tree_#t~mem14.base|) |create_tree_#t~mem14.offset| (_ bv0 32))))) (let ((.cse1 (select (select .cse0 c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|) (_ bv0 32))))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:30:31,626 WARN L838 $PredicateComparison]: unable to prove that (forall ((|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |create_tree_#t~mem14.offset| (_ bv0 32)))))) (let ((.cse1 (select (select .cse0 c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|) (_ bv0 32))))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:30:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:31,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:30:31,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121041512] [2021-08-27 06:30:31,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121041512] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:30:31,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:30:31,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2021-08-27 06:30:31,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001907503] [2021-08-27 06:30:31,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:30:31,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:30:31,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:30:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=152, Unknown=5, NotChecked=84, Total=306 [2021-08-27 06:30:31,941 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 06:30:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:41,066 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2021-08-27 06:30:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 06:30:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 28 [2021-08-27 06:30:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:41,074 INFO L225 Difference]: With dead ends: 158 [2021-08-27 06:30:41,075 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 06:30:41,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 14817.9ms TimeCoverageRelationStatistics Valid=118, Invalid=308, Unknown=6, NotChecked=120, Total=552 [2021-08-27 06:30:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 06:30:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2021-08-27 06:30:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 146 states have internal predecessors, (159), 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 06:30:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2021-08-27 06:30:41,079 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 28 [2021-08-27 06:30:41,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:41,079 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2021-08-27 06:30:41,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 06:30:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2021-08-27 06:30:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:30:41,080 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:41,080 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:30:41,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:41,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:30:41,285 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_treeErr21REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:30:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1433210719, now seen corresponding path program 1 times [2021-08-27 06:30:41,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:30:41,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552982381] [2021-08-27 06:30:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:41,286 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:30:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:30:41,287 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:30:41,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:30:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:41,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:30:41,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:41,735 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 06:30:41,791 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 06:30:41,807 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:41,807 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 14 treesize of output 14 [2021-08-27 06:30:41,836 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 06:30:41,844 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 06:30:41,980 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:30:41,981 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 06:30:41,999 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:30:42,000 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 06:30:42,214 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:30:42,214 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 06:30:42,261 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 06:30:42,262 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 06:30:48,434 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:30:48,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-08-27 06:30:48,442 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:30:48,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2021-08-27 06:30:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:30:48,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:31:37,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-08-27 06:31:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:31:37,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:31:37,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552982381] [2021-08-27 06:31:37,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552982381] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:31:37,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:31:37,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2021-08-27 06:31:37,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793413618] [2021-08-27 06:31:37,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:31:37,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:31:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:31:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=227, Unknown=14, NotChecked=0, Total=306 [2021-08-27 06:31:37,792 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 06:32:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:10,904 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2021-08-27 06:32:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:32:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 28 [2021-08-27 06:32:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:10,908 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:32:10,909 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:32:10,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 70941.6ms TimeCoverageRelationStatistics Valid=182, Invalid=609, Unknown=21, NotChecked=0, Total=812 [2021-08-27 06:32:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:32:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 06:32:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5643564356435644) internal successors, (158), 146 states have internal predecessors, (158), 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 06:32:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2021-08-27 06:32:10,914 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 28 [2021-08-27 06:32:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:10,914 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2021-08-27 06:32:10,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 06:32:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2021-08-27 06:32:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:32:10,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:10,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:10,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:11,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:11,127 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_treeErr24REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:32:11,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 510703779, now seen corresponding path program 1 times [2021-08-27 06:32:11,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:11,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440245473] [2021-08-27 06:32:11,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:11,128 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:11,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:11,129 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 06:32:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:11,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:32:11,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:11,642 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 06:32:11,732 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:32:11,732 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 20 treesize of output 27 [2021-08-27 06:32:11,788 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 23 treesize of output 19 [2021-08-27 06:32:11,967 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:32:11,967 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 06:32:12,232 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:32:12,233 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 53 treesize of output 42 [2021-08-27 06:32:17,458 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 06:32:17,458 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 68 treesize of output 59 [2021-08-27 06:32:17,508 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 36 treesize of output 24 [2021-08-27 06:32:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:17,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:26,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)) v_DerPreprocessor_1))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))))))) is different from false [2021-08-27 06:32:35,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|) (_ bv0 32)))))) (let ((.cse1 (select (select .cse0 c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)) v_DerPreprocessor_1)))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))))))))) is different from false [2021-08-27 06:32:44,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32)) (|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) |create_tree_#t~mem14.offset| (_ bv0 32)))))) (let ((.cse3 (select (select .cse2 c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse2 .cse3 (store (select .cse2 .cse3) (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|) (_ bv0 32))))))) (let ((.cse1 (select (select .cse0 c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)) v_DerPreprocessor_1)))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:32:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:52,781 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:52,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440245473] [2021-08-27 06:32:52,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440245473] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:52,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:52,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 20 [2021-08-27 06:32:52,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750933015] [2021-08-27 06:32:52,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 06:32:52,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 06:32:52,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=12, NotChecked=102, Total=420 [2021-08-27 06:32:52,784 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 1 states have call successors, (3), 1 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 06:33:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:33:21,211 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2021-08-27 06:33:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:33:21,212 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 1 states have call successors, (3), 1 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 31 [2021-08-27 06:33:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:33:21,213 INFO L225 Difference]: With dead ends: 159 [2021-08-27 06:33:21,213 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 06:33:21,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 50173.1ms TimeCoverageRelationStatistics Valid=164, Invalid=534, Unknown=16, NotChecked=156, Total=870 [2021-08-27 06:33:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 06:33:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2021-08-27 06:33:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5544554455445545) internal successors, (157), 146 states have internal predecessors, (157), 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 06:33:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2021-08-27 06:33:21,216 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 31 [2021-08-27 06:33:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:33:21,216 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2021-08-27 06:33:21,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 1 states have call successors, (3), 1 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 06:33:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2021-08-27 06:33:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:33:21,217 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:33:21,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:33:21,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:33:21,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:33:21,425 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting create_treeErr25REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:33:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:33:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash 510703780, now seen corresponding path program 1 times [2021-08-27 06:33:21,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:33:21,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969235023] [2021-08-27 06:33:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:33:21,426 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:33:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:33:21,427 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:33:21,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 06:33:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:33:21,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 06:33:21,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:33:21,934 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 06:33:21,999 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 06:33:22,017 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:33:22,019 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 14 treesize of output 14 [2021-08-27 06:33:22,050 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 06:33:22,061 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 06:33:22,203 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:33:22,204 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 06:33:22,223 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-08-27 06:33:22,223 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 06:33:22,506 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-08-27 06:33:22,507 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 06:33:22,572 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-08-27 06:33:22,573 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 06:33:30,296 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-08-27 06:33:30,296 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 06:33:31,141 INFO L354 Elim1Store]: treesize reduction 98, result has 21.6 percent of original size [2021-08-27 06:33:31,141 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 06:33:31,217 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 39 treesize of output 27 [2021-08-27 06:33:31,223 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 24 treesize of output 16 [2021-08-27 06:33:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:33:31,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:33:58,175 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_tree_#t~mem15.base| (store (select |c_#memory_$Pointer$.base| |c_create_tree_#t~mem15.base|) .cse3 (_ bv0 32))))) (let ((.cse1 (select (select .cse4 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse2 (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)))) (bvule (bvadd (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem15.base| (store (select |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem15.base|) .cse3 (_ bv0 32))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_3))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_DerPreprocessor_2)) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse8 (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem15.base| (store (select |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem15.base|) .cse8 (_ bv0 32)))) (.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_create_tree_#t~mem15.base| (store (select |c_#memory_$Pointer$.base| |c_create_tree_#t~mem15.base|) .cse8 (_ bv0 32))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse6 .cse7 (store (select .cse6 .cse7) (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)) v_DerPreprocessor_3)))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32)))))) is different from false [2021-08-27 06:34:23,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_tree_#t~mem14.base| (store (select |c_#memory_$Pointer$.base| |c_create_tree_#t~mem14.base|) |create_tree_#t~mem14.offset| (_ bv0 32))))) (let ((.cse4 (select (select .cse3 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse5 (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|))) (let ((.cse1 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem14.base| (store (select |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem14.base|) |create_tree_#t~mem14.offset| (_ bv0 32))))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 (_ bv0 32))))) (.cse2 (select (select (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 (_ bv0 32))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)) v_DerPreprocessor_3))))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_create_tree_#t~mem14.base| (store (select |c_#memory_$Pointer$.base| |c_create_tree_#t~mem14.base|) |create_tree_#t~mem14.offset| (_ bv0 32))))) (let ((.cse11 (select (select .cse14 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse12 (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|))) (let ((.cse13 (store .cse14 .cse11 (store (select .cse14 .cse11) .cse12 (_ bv0 32))))) (let ((.cse8 (select (select .cse13 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse9 (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)))) (bvule (bvadd (select (select (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem14.base| (store (select |c_#memory_$Pointer$.offset| |c_create_tree_#t~mem14.base|) |create_tree_#t~mem14.offset| (_ bv0 32))))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 (_ bv0 32)))))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_DerPreprocessor_3))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset) (_ bv12 32)) (select |c_#length| (select (select (store .cse13 .cse8 (store (select .cse13 .cse8) .cse9 v_DerPreprocessor_2)) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))) is different from false [2021-08-27 06:34:27,372 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 (store (select |c_#memory_$Pointer$.base| .cse6) |create_tree_#t~mem14.offset| (_ bv0 32))))) (let ((.cse4 (select (select .cse8 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse5 (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|))) (let ((.cse7 (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 (_ bv0 32))))) (let ((.cse1 (select (select .cse7 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse2 (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)))) (bvule (bvadd (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse6 (store (select |c_#memory_$Pointer$.offset| .cse6) |create_tree_#t~mem14.offset| (_ bv0 32))))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 (_ bv0 32)))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_3))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_DerPreprocessor_2)) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))))))))) (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|create_tree_#t~mem14.offset| (_ BitVec 32)) (|create_tree_#t~mem15.offset| (_ BitVec 32)) (|create_tree_#t~mem16.offset| (_ BitVec 32))) (let ((.cse9 (select (select (let ((.cse16 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) |create_tree_#t~mem14.offset| (_ bv0 32))))) (let ((.cse13 (select (select .cse12 c_create_tree_~node~0.base) c_create_tree_~node~0.offset)) (.cse14 (bvadd (_ bv4 32) |create_tree_#t~mem15.offset|))) (let ((.cse10 (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse16 (store (select |c_#memory_$Pointer$.offset| .cse16) |create_tree_#t~mem14.offset| (_ bv0 32))))) (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 (_ bv0 32))))) (.cse11 (select (select (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 (_ bv0 32))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store .cse10 .cse11 (store (select .cse10 .cse11) (bvadd |create_tree_#t~mem16.offset| (_ bv12 32)) v_DerPreprocessor_3)))))) c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (bvule (bvadd (_ bv8 32) .cse9) (bvadd .cse9 (_ bv12 32)))))) is different from false [2021-08-27 06:34:29,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:34:29,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:34:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:34:30,487 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:34:30,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969235023] [2021-08-27 06:34:30,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969235023] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:30,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:30,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 19 [2021-08-27 06:34:30,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699646008] [2021-08-27 06:34:30,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 06:34:30,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:30,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 06:34:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=194, Unknown=20, NotChecked=96, Total=380 [2021-08-27 06:34:30,489 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (3), 1 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 06:35:16,746 WARN L207 SmtUtils]: Spent 6.48 s on a formula simplification that was a NOOP. DAG size: 48 [2021-08-27 06:35:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:20,249 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-08-27 06:35:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 06:35:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (3), 1 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 31 [2021-08-27 06:35:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:20,250 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:35:20,251 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:35:20,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 99867.0ms TimeCoverageRelationStatistics Valid=205, Invalid=709, Unknown=28, NotChecked=180, Total=1122 [2021-08-27 06:35:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:35:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 06:35:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 146 states have internal predecessors, (156), 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 06:35:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2021-08-27 06:35:20,261 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 31 [2021-08-27 06:35:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:20,262 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2021-08-27 06:35:20,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (3), 1 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 06:35:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2021-08-27 06:35:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 06:35:20,266 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:20,267 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] [2021-08-27 06:35:20,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 06:35:20,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:35:20,480 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting create_treeErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, create_treeErr0REQUIRES_VIOLATION, create_treeErr1REQUIRES_VIOLATION (and 59 more)] === [2021-08-27 06:35:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2133289735, now seen corresponding path program 1 times [2021-08-27 06:35:20,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:20,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319434853] [2021-08-27 06:35:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:20,481 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:20,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:20,481 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:35:20,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 06:35:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:21,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:35:21,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:21,142 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 06:35:21,175 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 06:35:21,193 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 06:35:21,358 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 06:35:21,358 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 06:35:21,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:21,383 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 06:35:21,477 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:35:21,477 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 14 treesize of output 14 [2021-08-27 06:35:21,592 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-08-27 06:35:21,592 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 21 treesize of output 20 [2021-08-27 06:35:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:21,614 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 25 treesize of output 24 [2021-08-27 06:35:21,904 INFO L354 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2021-08-27 06:35:21,905 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 65 treesize of output 54 [2021-08-27 06:35:21,938 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-08-27 06:35:21,938 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 57 treesize of output 52 [2021-08-27 06:35:22,303 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-27 06:35:22,303 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 91 treesize of output 75 [2021-08-27 06:35:22,381 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:35:22,382 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 83 treesize of output 81 [2021-08-27 06:35:29,739 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-08-27 06:35:29,739 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 115 treesize of output 97 [2021-08-27 06:35:31,041 INFO L354 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2021-08-27 06:35:31,041 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 90 treesize of output 71 [2021-08-27 06:35:31,278 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-08-27 06:35:31,279 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 69 treesize of output 58 [2021-08-27 06:35:31,319 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:35:31,320 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 61 treesize of output 56 [2021-08-27 06:35:31,535 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:35:31,535 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 71 treesize of output 44 [2021-08-27 06:35:31,544 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:35:31,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2021-08-27 06:35:31,672 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 06:35:31,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:44,154 WARN L207 SmtUtils]: Spent 10.01 s on a formula simplification that was a NOOP. DAG size: 26 [2021-08-27 06:35:46,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|create_tree_#t~mem17.offset| (_ BitVec 32))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv8 32) |create_tree_#t~mem17.offset|) c_create_tree_~node~0.base))) c_create_tree_~node~0.base) (bvadd c_create_tree_~node~0.offset (_ bv4 32))) (_ bv0 32))) (forall ((|create_tree_#t~mem17.offset| (_ BitVec 32))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_tree_~node~0.base) c_create_tree_~node~0.offset))) (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) (bvadd (_ bv8 32) |create_tree_#t~mem17.offset|) c_create_tree_~node~0.offset))) c_create_tree_~node~0.base) (bvadd c_create_tree_~node~0.offset (_ bv4 32))) (_ bv0 32)))) is different from false [2021-08-27 06:35:46,208 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:46,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319434853] [2021-08-27 06:35:46,209 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:35:46,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1974142951] [2021-08-27 06:35:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:46,209 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:35:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:35:46,210 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:35:46,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-08-27 06:35:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:46,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-27 06:35:46,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:47,050 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 06:35:47,167 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 06:35:47,177 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 06:35:47,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:47,402 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 06:35:47,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:47,423 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 06:35:47,514 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:35:47,515 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 19 treesize of output 19 [2021-08-27 06:35:47,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:47,631 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 25 treesize of output 24 [2021-08-27 06:35:47,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:47,647 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 21 treesize of output 20 [2021-08-27 06:35:47,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:48,012 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-08-27 06:35:48,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 54 [2021-08-27 06:35:48,049 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-08-27 06:35:48,050 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 57 treesize of output 52 [2021-08-27 06:35:52,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:35:52,537 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-08-27 06:35:52,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 75 [2021-08-27 06:35:52,589 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:35:52,589 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 83 treesize of output 81 [2021-08-27 06:35:59,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:00,112 INFO L354 Elim1Store]: treesize reduction 130, result has 19.8 percent of original size [2021-08-27 06:36:00,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 97 [2021-08-27 06:36:01,063 INFO L354 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2021-08-27 06:36:01,064 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 90 treesize of output 71 [2021-08-27 06:36:01,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:01,330 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-08-27 06:36:01,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2021-08-27 06:36:01,358 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:36:01,358 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 61 treesize of output 56 [2021-08-27 06:36:01,593 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-08-27 06:36:01,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 40 [2021-08-27 06:36:01,601 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:36:01,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 17 [2021-08-27 06:36:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:01,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:01,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:36:01,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359886420] [2021-08-27 06:36:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:01,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:36:01,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:36:01,750 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:36:01,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-27 06:36:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:02,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:36:02,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:02,546 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 06:36:02,722 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 06:36:02,741 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 06:36:02,831 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 06:36:02,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 06:36:02,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:02,848 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 06:36:02,916 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:36:02,916 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 14 treesize of output 14 [2021-08-27 06:36:02,959 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-08-27 06:36:02,960 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 21 treesize of output 20 [2021-08-27 06:36:02,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:36:02,972 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 25 treesize of output 24 [2021-08-27 06:36:03,104 INFO L354 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2021-08-27 06:36:03,104 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 65 treesize of output 54 [2021-08-27 06:36:03,132 INFO L354 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-08-27 06:36:03,132 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 57 treesize of output 52 [2021-08-27 06:36:03,326 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-27 06:36:03,326 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 91 treesize of output 75 [2021-08-27 06:36:03,400 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:36:03,400 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 83 treesize of output 81 [2021-08-27 06:36:04,505 INFO L354 Elim1Store]: treesize reduction 140, result has 18.6 percent of original size [2021-08-27 06:36:04,505 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 115 treesize of output 97 [2021-08-27 06:36:05,686 INFO L354 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2021-08-27 06:36:05,686 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 90 treesize of output 71 [2021-08-27 06:36:05,829 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-08-27 06:36:05,829 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 69 treesize of output 58 [2021-08-27 06:36:05,858 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-08-27 06:36:05,859 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 61 treesize of output 56 [2021-08-27 06:36:05,940 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-27 06:36:05,940 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 71 treesize of output 44 [2021-08-27 06:36:05,947 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:36:05,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2021-08-27 06:36:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:36:05,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:06,101 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:36:06,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:36:06,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:36:06,102 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:36:06,102 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:36:06,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr9REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location failErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr0REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr1REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr2REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr3REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr4REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr5REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr6REQUIRES_VIOLATION [2021-08-27 06:36:06,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr7REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr8REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr10REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr11REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr12REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr13REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr14REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr15REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr16REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr17REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr18REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr19REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr20REQUIRES_VIOLATION [2021-08-27 06:36:06,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr21REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr22REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr23REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr24REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr25REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr26REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location create_treeErr27REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr0REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr1REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr2REQUIRES_VIOLATION [2021-08-27 06:36:06,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr3REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr4REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr5REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr6REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr7REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr8REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr9REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr0REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr1REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr2REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr3REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr4REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr5REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr6REQUIRES_VIOLATION [2021-08-27 06:36:06,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr7REQUIRES_VIOLATION [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr8ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr9ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr10ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr11REQUIRES_VIOLATION [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr12REQUIRES_VIOLATION [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr13REQUIRES_VIOLATION [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr14REQUIRES_VIOLATION [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr15ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr16ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr17ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr18REQUIRES_VIOLATION [2021-08-27 06:36:06,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr19REQUIRES_VIOLATION [2021-08-27 06:36:06,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr20ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr21ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location free_treeErr22ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:36:06,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:06,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:06,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2021-08-27 06:36:06,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-08-27 06:36:06,722 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:36:06,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:36:06 BoogieIcfgContainer [2021-08-27 06:36:06,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:36:06,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:36:06,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:36:06,736 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:36:06,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:29:48" (3/4) ... [2021-08-27 06:36:06,740 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:36:06,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:36:06,741 INFO L168 Benchmark]: Toolchain (without parser) took 380565.83 ms. Allocated memory was 50.3 MB in the beginning and 188.7 MB in the end (delta: 138.4 MB). Free memory was 25.3 MB in the beginning and 148.5 MB in the end (delta: -123.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:06,741 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 50.3 MB. Free memory was 31.9 MB in the beginning and 31.9 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:36:06,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.82 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.1 MB in the beginning and 35.3 MB in the end (delta: -10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:06,742 INFO L168 Benchmark]: Boogie Preprocessor took 112.76 ms. Allocated memory is still 60.8 MB. Free memory was 35.1 MB in the beginning and 31.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:06,742 INFO L168 Benchmark]: RCFGBuilder took 1350.63 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 31.7 MB in the beginning and 39.2 MB in the end (delta: -7.5 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:06,745 INFO L168 Benchmark]: TraceAbstraction took 378689.28 ms. Allocated memory was 73.4 MB in the beginning and 188.7 MB in the end (delta: 115.3 MB). Free memory was 38.4 MB in the beginning and 149.6 MB in the end (delta: -111.2 MB). Peak memory consumption was 109.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:06,745 INFO L168 Benchmark]: Witness Printer took 4.20 ms. Allocated memory is still 188.7 MB. Free memory was 149.6 MB in the beginning and 148.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:36:06,746 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.21 ms. Allocated memory is still 50.3 MB. Free memory was 31.9 MB in the beginning and 31.9 MB in the end (delta: 37.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.82 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.1 MB in the beginning and 35.3 MB in the end (delta: -10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 112.76 ms. Allocated memory is still 60.8 MB. Free memory was 35.1 MB in the beginning and 31.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1350.63 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 31.7 MB in the beginning and 39.2 MB in the end (delta: -7.5 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 378689.28 ms. Allocated memory was 73.4 MB in the beginning and 188.7 MB in the end (delta: 115.3 MB). Free memory was 38.4 MB in the beginning and 149.6 MB in the end (delta: -111.2 MB). Peak memory consumption was 109.3 MB. Max. memory is 16.1 GB. * Witness Printer took 4.20 ms. Allocated memory is still 188.7 MB. Free memory was 149.6 MB in the beginning and 148.5 MB in the end (delta: 1.2 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 - UnprovableResult [Line: 600]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L630] CALL create_tree() [L585] struct node *nodelast = ((void *)0); [L586] struct node *node = ((void *)0); [L587] COND TRUE __VERIFIER_nondet_int() [L588] node = malloc(sizeof *node) [L589] COND FALSE !(!node) [L591] node->left = ((void *)0) [L592] node->right = nodelast [L593] COND FALSE !(\read(*nodelast)) [L595] int value = __VERIFIER_nondet_int(); [L596] node->value = value [L597] nodelast = node [L587] COND FALSE !(__VERIFIER_nondet_int()) [L599] COND TRUE node != ((void *)0) [L600] node->left = malloc(sizeof *node) [L601] COND FALSE !(!node) [L603] EXPR node->left [L603] node->left->left = ((void *)0) [L604] EXPR node->left [L604] node->left->right = ((void *)0) [L605] EXPR node->left [L605] node->left->value = 42 [L606] EXPR node->left [L606] node->left->parent = node [L607] EXPR node->right [L607] node = node->right [L599] COND TRUE node != ((void *)0) [L600] node->left = malloc(sizeof *node) - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: 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: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: 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: 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: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: 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: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that free always succeeds Unable to prove that free 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: 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: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 626]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 174 locations, 63 error locations. Started 1 CEGAR loops. OverallTime: 378619.2ms, OverallIterations: 19, TraceHistogramMax: 2, EmptinessCheckTime: 24.2ms, AutomataDifference: 130705.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2397 SDtfs, 870 SDslu, 6783 SDs, 0 SdLazy, 3558 SolverSat, 140 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 55298.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 778 GetRequests, 585 SyntacticMatches, 11 SemanticMatches, 182 ConstructedPredicates, 11 IntricatePredicates, 2 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 246722.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=6, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 133.0ms AutomataMinimizationTime, 18 MinimizatonAttempts, 99 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 193.3ms SsaConstructionTime, 786.2ms SatisfiabilityAnalysisTime, 192821.4ms InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 692 ConstructedInterpolants, 94 QuantifiedInterpolants, 16692 SizeOfPredicates, 101 NumberOfNonLiveVariables, 2063 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 36 InterpolantComputations, 32 PerfectInterpolantSequences, 22/38 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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:36:06,897 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...