./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 19:19:11,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 19:19:11,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 19:19:11,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 19:19:11,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 19:19:11,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 19:19:11,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 19:19:11,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 19:19:11,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 19:19:11,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 19:19:11,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 19:19:11,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 19:19:11,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 19:19:11,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 19:19:11,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 19:19:11,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 19:19:11,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 19:19:11,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 19:19:11,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 19:19:11,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 19:19:11,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 19:19:11,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 19:19:11,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 19:19:11,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 19:19:11,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 19:19:11,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 19:19:11,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 19:19:11,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 19:19:11,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 19:19:11,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 19:19:11,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 19:19:11,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 19:19:11,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 19:19:11,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 19:19:11,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 19:19:11,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 19:19:11,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 19:19:11,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 19:19:11,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 19:19:11,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 19:19:11,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 19:19:11,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-18 19:19:11,114 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 19:19:11,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 19:19:11,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 19:19:11,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 19:19:11,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 19:19:11,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 19:19:11,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 19:19:11,121 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 19:19:11,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 19:19:11,122 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 19:19:11,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 19:19:11,123 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 19:19:11,123 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 19:19:11,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 19:19:11,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 19:19:11,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 19:19:11,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 19:19:11,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 19:19:11,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 19:19:11,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 19:19:11,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 19:19:11,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 19:19:11,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 19:19:11,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2021-12-18 19:19:11,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 19:19:11,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 19:19:11,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 19:19:11,345 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 19:19:11,345 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 19:19:11,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2021-12-18 19:19:11,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4498f3007/304fa685383a4119ba06ca684dc4e854/FLAG64325a1be [2021-12-18 19:19:11,817 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 19:19:11,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2021-12-18 19:19:11,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4498f3007/304fa685383a4119ba06ca684dc4e854/FLAG64325a1be [2021-12-18 19:19:11,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4498f3007/304fa685383a4119ba06ca684dc4e854 [2021-12-18 19:19:11,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 19:19:11,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 19:19:11,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 19:19:11,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 19:19:11,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 19:19:11,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68eee4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11, skipping insertion in model container [2021-12-18 19:19:11,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 19:19:11,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 19:19:12,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2021-12-18 19:19:12,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 19:19:12,075 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 19:19:12,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i[22626,22639] [2021-12-18 19:19:12,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 19:19:12,152 INFO L208 MainTranslator]: Completed translation [2021-12-18 19:19:12,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12 WrapperNode [2021-12-18 19:19:12,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 19:19:12,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 19:19:12,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 19:19:12,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 19:19:12,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,195 INFO L137 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2021-12-18 19:19:12,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 19:19:12,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 19:19:12,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 19:19:12,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 19:19:12,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 19:19:12,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 19:19:12,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 19:19:12,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 19:19:12,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (1/1) ... [2021-12-18 19:19:12,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 19:19:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 19:19:12,262 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-12-18 19:19:12,277 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-12-18 19:19:12,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 19:19:12,293 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-12-18 19:19:12,293 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-12-18 19:19:12,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 19:19:12,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 19:19:12,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 19:19:12,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 19:19:12,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 19:19:12,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 19:19:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 19:19:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 19:19:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 19:19:12,368 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 19:19:12,369 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 19:19:12,690 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 19:19:12,698 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 19:19:12,699 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 19:19:12,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12 BoogieIcfgContainer [2021-12-18 19:19:12,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 19:19:12,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 19:19:12,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 19:19:12,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 19:19:12,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:19:11" (1/3) ... [2021-12-18 19:19:12,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3574644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:19:12, skipping insertion in model container [2021-12-18 19:19:12,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:12" (2/3) ... [2021-12-18 19:19:12,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3574644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:19:12, skipping insertion in model container [2021-12-18 19:19:12,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12" (3/3) ... [2021-12-18 19:19:12,708 INFO L111 eAbstractionObserver]: Analyzing ICFG tree-4.i [2021-12-18 19:19:12,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 19:19:12,713 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-12-18 19:19:12,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 19:19:12,748 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, mAutomataTypeConcurrency=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-12-18 19:19:12,748 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-12-18 19:19:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 147 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-18 19:19:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 19:19:12,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:12,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 19:19:12,765 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash 31591498, now seen corresponding path program 1 times [2021-12-18 19:19:12,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629382338] [2021-12-18 19:19:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:12,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:12,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:12,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629382338] [2021-12-18 19:19:12,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629382338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:12,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:12,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:12,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611917693] [2021-12-18 19:19:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:12,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 19:19:12,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 19:19:12,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 19:19:12,905 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 2.1772151898734178) internal successors, (172), 147 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:12,926 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-12-18 19:19:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 19:19:12,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 19:19:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:12,933 INFO L225 Difference]: With dead ends: 147 [2021-12-18 19:19:12,933 INFO L226 Difference]: Without dead ends: 145 [2021-12-18 19:19:12,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 19:19:12,936 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:12,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 19:19:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-18 19:19:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-12-18 19:19:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 77 states have (on average 2.0) internal successors, (154), 143 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2021-12-18 19:19:12,970 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 5 [2021-12-18 19:19:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:12,970 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2021-12-18 19:19:12,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2021-12-18 19:19:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 19:19:12,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:12,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 19:19:12,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 19:19:12,971 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash 978320648, now seen corresponding path program 1 times [2021-12-18 19:19:12,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:12,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282161535] [2021-12-18 19:19:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:12,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282161535] [2021-12-18 19:19:13,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282161535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 19:19:13,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441401475] [2021-12-18 19:19:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:13,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:13,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,008 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,075 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-12-18 19:19:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,076 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 19:19:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,077 INFO L225 Difference]: With dead ends: 149 [2021-12-18 19:19:13,077 INFO L226 Difference]: Without dead ends: 149 [2021-12-18 19:19:13,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,078 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 89 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-18 19:19:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-12-18 19:19:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.962962962962963) internal successors, (159), 147 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2021-12-18 19:19:13,090 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 6 [2021-12-18 19:19:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,091 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2021-12-18 19:19:13,091 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2021-12-18 19:19:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 19:19:13,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 19:19:13,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash 978321707, now seen corresponding path program 1 times [2021-12-18 19:19:13,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262108654] [2021-12-18 19:19:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262108654] [2021-12-18 19:19:13,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262108654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:13,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181512291] [2021-12-18 19:19:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:13,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:13,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,142 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,304 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2021-12-18 19:19:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,305 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 19:19:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,309 INFO L225 Difference]: With dead ends: 224 [2021-12-18 19:19:13,309 INFO L226 Difference]: Without dead ends: 224 [2021-12-18 19:19:13,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,315 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 235 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-18 19:19:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 142. [2021-12-18 19:19:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 83 states have (on average 1.855421686746988) internal successors, (154), 140 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2021-12-18 19:19:13,338 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 6 [2021-12-18 19:19:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,339 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2021-12-18 19:19:13,339 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2021-12-18 19:19:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 19:19:13,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 19:19:13,342 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash 978321708, now seen corresponding path program 1 times [2021-12-18 19:19:13,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158386521] [2021-12-18 19:19:13,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158386521] [2021-12-18 19:19:13,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158386521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:13,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932911189] [2021-12-18 19:19:13,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:13,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:13,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,391 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,520 INFO L93 Difference]: Finished difference Result 244 states and 267 transitions. [2021-12-18 19:19:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,521 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 19:19:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,522 INFO L225 Difference]: With dead ends: 244 [2021-12-18 19:19:13,522 INFO L226 Difference]: Without dead ends: 244 [2021-12-18 19:19:13,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,523 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 127 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 265 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-18 19:19:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 153. [2021-12-18 19:19:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7551020408163265) internal successors, (172), 151 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2021-12-18 19:19:13,547 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 6 [2021-12-18 19:19:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,548 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2021-12-18 19:19:13,548 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2021-12-18 19:19:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 19:19:13,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 19:19:13,550 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash -466102223, now seen corresponding path program 1 times [2021-12-18 19:19:13,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009243770] [2021-12-18 19:19:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009243770] [2021-12-18 19:19:13,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009243770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 19:19:13,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286268673] [2021-12-18 19:19:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:13,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,616 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,634 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2021-12-18 19:19:13,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,634 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 19:19:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,635 INFO L225 Difference]: With dead ends: 242 [2021-12-18 19:19:13,635 INFO L226 Difference]: Without dead ends: 242 [2021-12-18 19:19:13,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,639 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 93 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 19:19:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-18 19:19:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 157. [2021-12-18 19:19:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.7254901960784315) internal successors, (176), 155 states have internal predecessors, (176), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-12-18 19:19:13,647 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 9 [2021-12-18 19:19:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,647 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-12-18 19:19:13,647 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-12-18 19:19:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 19:19:13,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 19:19:13,648 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1908517563, now seen corresponding path program 1 times [2021-12-18 19:19:13,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818045217] [2021-12-18 19:19:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818045217] [2021-12-18 19:19:13,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818045217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:13,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051257937] [2021-12-18 19:19:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:13,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:13,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,680 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,790 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2021-12-18 19:19:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,791 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 19:19:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,792 INFO L225 Difference]: With dead ends: 237 [2021-12-18 19:19:13,793 INFO L226 Difference]: Without dead ends: 236 [2021-12-18 19:19:13,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,795 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 79 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 198 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-18 19:19:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 161. [2021-12-18 19:19:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 159 states have internal predecessors, (180), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2021-12-18 19:19:13,808 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 10 [2021-12-18 19:19:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,809 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2021-12-18 19:19:13,809 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2021-12-18 19:19:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 19:19:13,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 19:19:13,810 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:13,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash 134253526, now seen corresponding path program 1 times [2021-12-18 19:19:13,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372322408] [2021-12-18 19:19:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372322408] [2021-12-18 19:19:13,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372322408] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 19:19:13,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123035326] [2021-12-18 19:19:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:13,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:13,866 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,901 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2021-12-18 19:19:13,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 19:19:13,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 19:19:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,902 INFO L225 Difference]: With dead ends: 166 [2021-12-18 19:19:13,902 INFO L226 Difference]: Without dead ends: 161 [2021-12-18 19:19:13,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:13,905 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 11 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 550 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 19:19:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-18 19:19:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2021-12-18 19:19:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 154 states have internal predecessors, (174), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2021-12-18 19:19:13,910 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 12 [2021-12-18 19:19:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,910 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2021-12-18 19:19:13,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2021-12-18 19:19:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 19:19:13,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,912 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 19:19:13,912 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 570713568, now seen corresponding path program 1 times [2021-12-18 19:19:13,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706703743] [2021-12-18 19:19:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706703743] [2021-12-18 19:19:14,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706703743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 19:19:14,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825834439] [2021-12-18 19:19:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 19:19:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 19:19:14,030 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-12-18 19:19:14,031 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-12-18 19:19:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 19:19:14,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 19:19:14,196 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-12-18 19:19:14,259 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 19:19:14,260 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-12-18 19:19:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 19:19:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825834439] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 19:19:14,449 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 19:19:14,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-18 19:19:14,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683141853] [2021-12-18 19:19:14,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 19:19:14,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 19:19:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:14,452 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:14,584 INFO L93 Difference]: Finished difference Result 278 states and 310 transitions. [2021-12-18 19:19:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 19:19:14,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 19:19:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:14,590 INFO L225 Difference]: With dead ends: 278 [2021-12-18 19:19:14,590 INFO L226 Difference]: Without dead ends: 278 [2021-12-18 19:19:14,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:14,591 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 403 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:14,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 261 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2021-12-18 19:19:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-18 19:19:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 155. [2021-12-18 19:19:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 153 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2021-12-18 19:19:14,598 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 18 [2021-12-18 19:19:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:14,598 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2021-12-18 19:19:14,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2021-12-18 19:19:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 19:19:14,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:14,599 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,627 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-12-18 19:19:14,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 19:19:14,811 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash 570713569, now seen corresponding path program 1 times [2021-12-18 19:19:14,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:14,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563902733] [2021-12-18 19:19:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563902733] [2021-12-18 19:19:14,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563902733] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 19:19:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254629103] [2021-12-18 19:19:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 19:19:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 19:19:14,916 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-12-18 19:19:14,917 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-12-18 19:19:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:15,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 19:19:15,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 19:19:15,039 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-12-18 19:19:15,042 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-12-18 19:19:15,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:15,139 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 12 treesize of output 14 [2021-12-18 19:19:15,146 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 19:19:15,147 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-12-18 19:19:15,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-12-18 19:19:15,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 19:19:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:15,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254629103] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 19:19:15,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 19:19:15,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-18 19:19:15,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959826693] [2021-12-18 19:19:15,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 19:19:15,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 19:19:15,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 19:19:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-18 19:19:15,378 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:15,608 INFO L93 Difference]: Finished difference Result 327 states and 353 transitions. [2021-12-18 19:19:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:15,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 19:19:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:15,610 INFO L225 Difference]: With dead ends: 327 [2021-12-18 19:19:15,610 INFO L226 Difference]: Without dead ends: 327 [2021-12-18 19:19:15,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-18 19:19:15,611 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 722 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:15,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 303 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 308 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2021-12-18 19:19:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-18 19:19:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 154. [2021-12-18 19:19:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.702970297029703) internal successors, (172), 152 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2021-12-18 19:19:15,614 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 18 [2021-12-18 19:19:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:15,614 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2021-12-18 19:19:15,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2021-12-18 19:19:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 19:19:15,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:15,614 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:15,649 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-12-18 19:19:15,827 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,SelfDestructingSolverStorable8 [2021-12-18 19:19:15,828 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash -309931284, now seen corresponding path program 1 times [2021-12-18 19:19:15,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:15,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514812341] [2021-12-18 19:19:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:15,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:15,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:15,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514812341] [2021-12-18 19:19:15,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514812341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:15,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:15,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 19:19:15,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483214296] [2021-12-18 19:19:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:15,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:15,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:15,854 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:15,880 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-12-18 19:19:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:15,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 19:19:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:15,881 INFO L225 Difference]: With dead ends: 162 [2021-12-18 19:19:15,881 INFO L226 Difference]: Without dead ends: 162 [2021-12-18 19:19:15,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:15,882 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:15,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 19:19:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-18 19:19:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2021-12-18 19:19:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 100 states have (on average 1.69) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2021-12-18 19:19:15,885 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 19 [2021-12-18 19:19:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:15,886 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2021-12-18 19:19:15,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2021-12-18 19:19:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 19:19:15,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:15,889 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:15,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 19:19:15,889 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash 145073858, now seen corresponding path program 1 times [2021-12-18 19:19:15,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:15,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267375379] [2021-12-18 19:19:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:15,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 19:19:15,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267375379] [2021-12-18 19:19:15,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267375379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:15,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:15,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:15,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793250999] [2021-12-18 19:19:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:15,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:15,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:15,934 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,024 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2021-12-18 19:19:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-18 19:19:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,025 INFO L225 Difference]: With dead ends: 152 [2021-12-18 19:19:16,025 INFO L226 Difference]: Without dead ends: 152 [2021-12-18 19:19:16,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:16,026 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 7 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-18 19:19:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-18 19:19:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.67) internal successors, (167), 150 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2021-12-18 19:19:16,030 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 21 [2021-12-18 19:19:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,030 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2021-12-18 19:19:16,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2021-12-18 19:19:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 19:19:16,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,031 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:16,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 19:19:16,031 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash 145073859, now seen corresponding path program 1 times [2021-12-18 19:19:16,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023923300] [2021-12-18 19:19:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 19:19:16,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023923300] [2021-12-18 19:19:16,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023923300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:16,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452612172] [2021-12-18 19:19:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:16,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:16,082 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,174 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2021-12-18 19:19:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:16,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-18 19:19:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,175 INFO L225 Difference]: With dead ends: 151 [2021-12-18 19:19:16,175 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 19:19:16,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:16,176 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 381 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 19:19:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-18 19:19:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.65) internal successors, (165), 149 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2021-12-18 19:19:16,179 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 21 [2021-12-18 19:19:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,179 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2021-12-18 19:19:16,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2021-12-18 19:19:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 19:19:16,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,180 INFO L514 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-12-18 19:19:16,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 19:19:16,180 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1158251601, now seen corresponding path program 1 times [2021-12-18 19:19:16,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260252545] [2021-12-18 19:19:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:16,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260252545] [2021-12-18 19:19:16,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260252545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:16,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218132687] [2021-12-18 19:19:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:16,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:16,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:16,249 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,410 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2021-12-18 19:19:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 19:19:16,410 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 19:19:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,411 INFO L225 Difference]: With dead ends: 152 [2021-12-18 19:19:16,411 INFO L226 Difference]: Without dead ends: 152 [2021-12-18 19:19:16,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-18 19:19:16,411 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 394 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-18 19:19:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-12-18 19:19:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.64) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2021-12-18 19:19:16,414 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 24 [2021-12-18 19:19:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,414 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2021-12-18 19:19:16,414 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2021-12-18 19:19:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 19:19:16,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,415 INFO L514 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-12-18 19:19:16,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 19:19:16,415 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1158251602, now seen corresponding path program 1 times [2021-12-18 19:19:16,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417607154] [2021-12-18 19:19:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:16,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417607154] [2021-12-18 19:19:16,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417607154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 19:19:16,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764168400] [2021-12-18 19:19:16,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 19:19:16,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 19:19:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 19:19:16,488 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,677 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2021-12-18 19:19:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 19:19:16,677 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 19:19:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,678 INFO L225 Difference]: With dead ends: 151 [2021-12-18 19:19:16,678 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 19:19:16,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-18 19:19:16,679 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 44 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 409 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 19:19:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-18 19:19:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.63) internal successors, (163), 149 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2021-12-18 19:19:16,681 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 24 [2021-12-18 19:19:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,681 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2021-12-18 19:19:16,681 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2021-12-18 19:19:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 19:19:16,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,682 INFO L514 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-12-18 19:19:16,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 19:19:16,682 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -293756023, now seen corresponding path program 1 times [2021-12-18 19:19:16,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731121239] [2021-12-18 19:19:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:16,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731121239] [2021-12-18 19:19:16,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731121239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:16,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:16,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 19:19:16,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119085185] [2021-12-18 19:19:16,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:16,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 19:19:16,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:16,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 19:19:16,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-18 19:19:16,758 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:16,986 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2021-12-18 19:19:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 19:19:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:16,989 INFO L225 Difference]: With dead ends: 152 [2021-12-18 19:19:16,989 INFO L226 Difference]: Without dead ends: 152 [2021-12-18 19:19:16,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-18 19:19:16,991 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:16,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 540 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-18 19:19:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-12-18 19:19:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.62) internal successors, (162), 149 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-12-18 19:19:16,994 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 27 [2021-12-18 19:19:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:16,995 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-12-18 19:19:16,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-12-18 19:19:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 19:19:16,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:16,996 INFO L514 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-12-18 19:19:16,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 19:19:16,997 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash -293756022, now seen corresponding path program 1 times [2021-12-18 19:19:16,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:16,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380596915] [2021-12-18 19:19:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:16,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:17,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:17,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380596915] [2021-12-18 19:19:17,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380596915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:17,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:17,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 19:19:17,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096019289] [2021-12-18 19:19:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:17,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 19:19:17,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 19:19:17,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-18 19:19:17,140 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:17,358 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2021-12-18 19:19:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 19:19:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 19:19:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:17,359 INFO L225 Difference]: With dead ends: 151 [2021-12-18 19:19:17,359 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 19:19:17,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-18 19:19:17,360 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:17,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 487 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 19:19:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-18 19:19:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.61) internal successors, (161), 149 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2021-12-18 19:19:17,363 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 27 [2021-12-18 19:19:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:17,363 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2021-12-18 19:19:17,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2021-12-18 19:19:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 19:19:17,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:17,363 INFO L514 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-12-18 19:19:17,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 19:19:17,363 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1857729656, now seen corresponding path program 1 times [2021-12-18 19:19:17,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:17,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588967395] [2021-12-18 19:19:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:17,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:17,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:17,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588967395] [2021-12-18 19:19:17,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588967395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:17,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:17,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 19:19:17,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006136453] [2021-12-18 19:19:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:17,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 19:19:17,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 19:19:17,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-18 19:19:17,465 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:17,761 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-18 19:19:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 19:19:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 19:19:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:17,762 INFO L225 Difference]: With dead ends: 153 [2021-12-18 19:19:17,763 INFO L226 Difference]: Without dead ends: 153 [2021-12-18 19:19:17,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-12-18 19:19:17,764 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:17,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 544 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-18 19:19:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2021-12-18 19:19:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.6) internal successors, (160), 149 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2021-12-18 19:19:17,768 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2021-12-18 19:19:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:17,769 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2021-12-18 19:19:17,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2021-12-18 19:19:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 19:19:17,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:17,770 INFO L514 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-12-18 19:19:17,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 19:19:17,774 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1857729657, now seen corresponding path program 1 times [2021-12-18 19:19:17,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:17,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848094749] [2021-12-18 19:19:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:17,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:17,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:17,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848094749] [2021-12-18 19:19:17,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848094749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:17,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:17,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 19:19:17,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814784693] [2021-12-18 19:19:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:17,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 19:19:17,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 19:19:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-18 19:19:17,921 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:18,214 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-12-18 19:19:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 19:19:18,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 19:19:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:18,215 INFO L225 Difference]: With dead ends: 151 [2021-12-18 19:19:18,215 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 19:19:18,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-12-18 19:19:18,215 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 50 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:18,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 569 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 19:19:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 19:19:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-18 19:19:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.59) internal successors, (159), 149 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2021-12-18 19:19:18,218 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 30 [2021-12-18 19:19:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:18,219 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2021-12-18 19:19:18,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2021-12-18 19:19:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 19:19:18,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:18,219 INFO L514 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] [2021-12-18 19:19:18,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 19:19:18,220 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 61 more)] === [2021-12-18 19:19:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1366780878, now seen corresponding path program 1 times [2021-12-18 19:19:18,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:18,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26624535] [2021-12-18 19:19:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:18,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:18,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:18,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26624535] [2021-12-18 19:19:18,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26624535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 19:19:18,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994983681] [2021-12-18 19:19:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:18,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 19:19:18,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 19:19:18,417 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-12-18 19:19:18,430 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-12-18 19:19:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:18,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-18 19:19:18,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 19:19:18,533 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-12-18 19:19:18,555 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-12-18 19:19:18,558 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-12-18 19:19:18,584 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 19:19:18,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 19:19:18,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:18,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 19:19:18,624 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 19:19:18,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 19:19:18,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:18,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 23 treesize of output 22 [2021-12-18 19:19:18,658 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 19:19:18,658 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-12-18 19:19:18,697 INFO L354 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2021-12-18 19:19:18,698 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 30 treesize of output 32 [2021-12-18 19:19:18,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:18,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:18,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:18,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-18 19:19:18,796 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 19:19:18,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2021-12-18 19:19:18,799 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 29 [2021-12-18 19:19:18,868 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 19:19:18,869 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 44 [2021-12-18 19:19:18,872 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 29 [2021-12-18 19:19:18,958 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 19:19:18,958 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 44 [2021-12-18 19:19:18,961 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 29 [2021-12-18 19:19:19,032 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 19:19:19,032 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 44 [2021-12-18 19:19:19,036 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 29 [2021-12-18 19:19:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 19:19:19,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2021-12-18 19:19:19,066 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-18 19:19:19,066 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 36 treesize of output 14 [2021-12-18 19:19:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:19,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 19:19:19,124 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_668) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_667) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,133 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,147 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_665 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem14#1.base| v_ArrVal_666))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,157 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_665 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,180 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_663))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_663))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem13#1.base| v_ArrVal_664) .cse2 v_ArrVal_665) (select (select (store .cse3 .cse2 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,189 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) (select (select (store .cse2 .cse1 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668)))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,207 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_661))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_662) .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) (select (select (store .cse2 .cse1 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem12#1.base| v_ArrVal_661))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:19,219 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_661))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_663)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_666)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_667)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0)) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int))) (= (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_661))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_663))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_662) .cse4 v_ArrVal_664) .cse5 v_ArrVal_665) (select (select (store .cse6 .cse5 v_ArrVal_666) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_668)))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4)) 0))) is different from false [2021-12-18 19:19:20,447 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-18 19:19:20,448 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 464 [2021-12-18 19:19:20,471 INFO L354 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2021-12-18 19:19:20,471 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 222 [2021-12-18 19:19:20,527 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-18 19:19:20,529 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 27183822 treesize of output 23569334 Killed by 15