./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:59:20,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:59:20,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:59:20,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:59:20,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:59:20,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:59:20,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:59:20,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:59:20,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:59:20,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:59:20,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:59:20,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:59:20,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:59:20,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:59:20,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:59:20,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:59:20,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:59:20,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:59:20,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:59:20,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:59:20,631 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:59:20,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:59:20,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:59:20,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:59:20,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:59:20,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:59:20,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:59:20,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:59:20,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:59:20,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:59:20,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:59:20,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:59:20,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:59:20,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:59:20,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:59:20,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:59:20,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:59:20,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:59:20,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:59:20,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:59:20,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:59:20,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:59:20,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:59:20,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:59:20,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:59:20,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:59:20,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:59:20,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:59:20,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:59:20,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:59:20,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:59:20,673 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:59:20,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:59:20,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:59:20,675 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:59:20,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:59:20,677 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:59:20,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:59:20,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:59:20,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:59:20,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:59:20,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:59:20,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:59:20,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:59:20,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:59:20,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:59:20,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:59:20,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2022-07-12 18:59:20,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:59:20,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:59:20,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:59:20,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:59:20,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:59:20,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-07-12 18:59:20,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b31198b2/1372832995a44cfe9b7fa90c83399052/FLAGaa7f544c2 [2022-07-12 18:59:21,335 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:59:21,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-07-12 18:59:21,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b31198b2/1372832995a44cfe9b7fa90c83399052/FLAGaa7f544c2 [2022-07-12 18:59:21,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b31198b2/1372832995a44cfe9b7fa90c83399052 [2022-07-12 18:59:21,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:59:21,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:59:21,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:59:21,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:59:21,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:59:21,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:59:21" (1/1) ... [2022-07-12 18:59:21,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563e8366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:21, skipping insertion in model container [2022-07-12 18:59:21,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:59:21" (1/1) ... [2022-07-12 18:59:21,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:59:21,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:59:22,011 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/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-07-12 18:59:22,015 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/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-07-12 18:59:22,016 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/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-07-12 18:59:22,018 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/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-07-12 18:59:22,018 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/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-07-12 18:59:22,020 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/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-07-12 18:59:22,021 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/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-07-12 18:59:22,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:59:22,036 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:59:22,072 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/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-07-12 18:59:22,077 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/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-07-12 18:59:22,078 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/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-07-12 18:59:22,083 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/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-07-12 18:59:22,084 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/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-07-12 18:59:22,085 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/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-07-12 18:59:22,087 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/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-07-12 18:59:22,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:59:22,112 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:59:22,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22 WrapperNode [2022-07-12 18:59:22,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:59:22,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:59:22,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:59:22,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:59:22,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,146 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-07-12 18:59:22,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:59:22,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:59:22,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:59:22,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:59:22,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:59:22,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:59:22,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:59:22,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:59:22,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (1/1) ... [2022-07-12 18:59:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:59:22,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:22,216 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) [2022-07-12 18:59:22,222 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 [2022-07-12 18:59:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:59:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:59:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:59:22,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:59:22,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:59:22,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:59:22,643 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:59:22,648 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:59:22,648 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-07-12 18:59:22,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:59:22 BoogieIcfgContainer [2022-07-12 18:59:22,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:59:22,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:59:22,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:59:22,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:59:22,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:59:21" (1/3) ... [2022-07-12 18:59:22,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505f4604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:59:22, skipping insertion in model container [2022-07-12 18:59:22,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:59:22" (2/3) ... [2022-07-12 18:59:22,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505f4604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:59:22, skipping insertion in model container [2022-07-12 18:59:22,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:59:22" (3/3) ... [2022-07-12 18:59:22,656 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2022-07-12 18:59:22,666 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:59:22,666 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-07-12 18:59:22,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:59:22,701 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f7f884b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50477539 [2022-07-12 18:59:22,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-07-12 18:59:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 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) [2022-07-12 18:59:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:59:22,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:22,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:59:22,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:22,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:59:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:22,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596503911] [2022-07-12 18:59:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596503911] [2022-07-12 18:59:22,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596503911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:22,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:22,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192284886] [2022-07-12 18:59:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:22,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:22,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:22,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:22,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:22,865 INFO L87 Difference]: Start difference. First operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:59:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:23,011 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2022-07-12 18:59:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-12 18:59:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:23,021 INFO L225 Difference]: With dead ends: 198 [2022-07-12 18:59:23,022 INFO L226 Difference]: Without dead ends: 196 [2022-07-12 18:59:23,023 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:23,026 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 151 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:23,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-12 18:59:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2022-07-12 18:59:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 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) [2022-07-12 18:59:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 178 transitions. [2022-07-12 18:59:23,053 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 178 transitions. Word has length 3 [2022-07-12 18:59:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:23,053 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 178 transitions. [2022-07-12 18:59:23,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:59:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 178 transitions. [2022-07-12 18:59:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:59:23,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:23,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:59:23,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:59:23,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:59:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:23,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384644943] [2022-07-12 18:59:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384644943] [2022-07-12 18:59:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384644943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:23,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:23,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:23,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265727412] [2022-07-12 18:59:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:23,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:23,086 INFO L87 Difference]: Start difference. First operand 170 states and 178 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:59:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:23,166 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-07-12 18:59:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-12 18:59:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:23,183 INFO L225 Difference]: With dead ends: 166 [2022-07-12 18:59:23,183 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 18:59:23,184 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:23,185 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:23,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 90 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 18:59:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-12 18:59:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 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) [2022-07-12 18:59:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2022-07-12 18:59:23,207 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 3 [2022-07-12 18:59:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:23,208 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2022-07-12 18:59:23,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:59:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-07-12 18:59:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:59:23,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:23,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:23,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:59:23,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:23,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-07-12 18:59:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621373362] [2022-07-12 18:59:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:23,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:23,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:23,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621373362] [2022-07-12 18:59:23,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621373362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:23,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:23,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156529954] [2022-07-12 18:59:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:23,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:23,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:23,285 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-12 18:59:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:23,360 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2022-07-12 18:59:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-07-12 18:59:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:23,361 INFO L225 Difference]: With dead ends: 162 [2022-07-12 18:59:23,362 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 18:59:23,362 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:23,363 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:23,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 103 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 18:59:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-07-12 18:59:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 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) [2022-07-12 18:59:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2022-07-12 18:59:23,367 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 7 [2022-07-12 18:59:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:23,368 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2022-07-12 18:59:23,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-12 18:59:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2022-07-12 18:59:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:59:23,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:23,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:23,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:59:23,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-07-12 18:59:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:23,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552780216] [2022-07-12 18:59:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:23,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552780216] [2022-07-12 18:59:23,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552780216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:23,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:23,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674328200] [2022-07-12 18:59:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:23,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:23,406 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-12 18:59:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:23,497 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2022-07-12 18:59:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-07-12 18:59:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:23,498 INFO L225 Difference]: With dead ends: 177 [2022-07-12 18:59:23,498 INFO L226 Difference]: Without dead ends: 177 [2022-07-12 18:59:23,499 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:23,499 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 134 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:23,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 112 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-12 18:59:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2022-07-12 18:59:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 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) [2022-07-12 18:59:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2022-07-12 18:59:23,504 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 7 [2022-07-12 18:59:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:23,504 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2022-07-12 18:59:23,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-12 18:59:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2022-07-12 18:59:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:59:23,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:23,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:23,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:59:23,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2022-07-12 18:59:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:23,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639065139] [2022-07-12 18:59:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:23,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639065139] [2022-07-12 18:59:23,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639065139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:23,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:23,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402143986] [2022-07-12 18:59:23,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:23,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:23,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:23,576 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-12 18:59:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:23,697 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-07-12 18:59:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-12 18:59:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:23,698 INFO L225 Difference]: With dead ends: 164 [2022-07-12 18:59:23,698 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 18:59:23,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:23,699 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 217 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:23,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 89 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 18:59:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2022-07-12 18:59:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 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) [2022-07-12 18:59:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2022-07-12 18:59:23,703 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 13 [2022-07-12 18:59:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:23,703 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2022-07-12 18:59:23,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-12 18:59:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2022-07-12 18:59:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:59:23,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:23,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:23,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:59:23,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2022-07-12 18:59:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:23,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306294886] [2022-07-12 18:59:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:23,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306294886] [2022-07-12 18:59:23,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306294886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:23,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:23,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:59:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946282631] [2022-07-12 18:59:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:23,769 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-12 18:59:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:23,927 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-07-12 18:59:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:23,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-12 18:59:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:23,928 INFO L225 Difference]: With dead ends: 193 [2022-07-12 18:59:23,928 INFO L226 Difference]: Without dead ends: 193 [2022-07-12 18:59:23,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:23,929 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 187 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:23,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 133 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-12 18:59:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2022-07-12 18:59:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 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) [2022-07-12 18:59:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-07-12 18:59:23,932 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 13 [2022-07-12 18:59:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:23,932 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-07-12 18:59:23,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-12 18:59:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-07-12 18:59:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:59:23,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:23,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:23,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:59:23,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2022-07-12 18:59:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009862899] [2022-07-12 18:59:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009862899] [2022-07-12 18:59:23,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009862899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:23,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:23,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568547150] [2022-07-12 18:59:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:23,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:23,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:23,971 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-12 18:59:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:24,110 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-07-12 18:59:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-07-12 18:59:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:24,112 INFO L225 Difference]: With dead ends: 202 [2022-07-12 18:59:24,112 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 18:59:24,112 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:24,113 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 302 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:24,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 157 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 18:59:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2022-07-12 18:59:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 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) [2022-07-12 18:59:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2022-07-12 18:59:24,116 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 15 [2022-07-12 18:59:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:24,117 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2022-07-12 18:59:24,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-12 18:59:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2022-07-12 18:59:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:24,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:24,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:24,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:59:24,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2022-07-12 18:59:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:24,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320695877] [2022-07-12 18:59:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320695877] [2022-07-12 18:59:24,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320695877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:24,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:24,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163868044] [2022-07-12 18:59:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:24,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:24,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:24,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:24,156 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-07-12 18:59:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:24,263 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2022-07-12 18:59:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:24,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-07-12 18:59:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:24,264 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:59:24,264 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:59:24,265 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:24,265 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:24,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 352 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:59:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-12 18:59:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 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) [2022-07-12 18:59:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-07-12 18:59:24,268 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 16 [2022-07-12 18:59:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:24,268 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-07-12 18:59:24,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-07-12 18:59:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-07-12 18:59:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:59:24,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:24,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:24,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:59:24,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2022-07-12 18:59:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:24,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199269966] [2022-07-12 18:59:24,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:24,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:24,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199269966] [2022-07-12 18:59:24,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199269966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:24,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:24,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617239314] [2022-07-12 18:59:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:24,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:24,325 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-07-12 18:59:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:24,448 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-07-12 18:59:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-07-12 18:59:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:24,449 INFO L225 Difference]: With dead ends: 160 [2022-07-12 18:59:24,449 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:59:24,449 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:24,450 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:24,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 343 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:59:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-12 18:59:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 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) [2022-07-12 18:59:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-07-12 18:59:24,453 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 16 [2022-07-12 18:59:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:24,453 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-07-12 18:59:24,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-07-12 18:59:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-07-12 18:59:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:59:24,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:24,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:24,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:59:24,455 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2022-07-12 18:59:24,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:24,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207221245] [2022-07-12 18:59:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:24,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207221245] [2022-07-12 18:59:24,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207221245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:24,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:24,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47638679] [2022-07-12 18:59:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:24,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:24,558 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-07-12 18:59:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:24,772 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-07-12 18:59:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:59:24,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 [2022-07-12 18:59:24,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:24,774 INFO L225 Difference]: With dead ends: 214 [2022-07-12 18:59:24,774 INFO L226 Difference]: Without dead ends: 214 [2022-07-12 18:59:24,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:59:24,774 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 333 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:24,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-12 18:59:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2022-07-12 18:59:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 states have internal predecessors, (176), 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) [2022-07-12 18:59:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2022-07-12 18:59:24,777 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 18 [2022-07-12 18:59:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:24,777 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2022-07-12 18:59:24,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-07-12 18:59:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2022-07-12 18:59:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:59:24,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:24,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:24,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:59:24,778 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2022-07-12 18:59:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:24,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748733954] [2022-07-12 18:59:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:24,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748733954] [2022-07-12 18:59:24,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748733954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:24,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:24,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145198440] [2022-07-12 18:59:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:24,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:59:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:59:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:24,846 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-07-12 18:59:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:25,124 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-07-12 18:59:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:59:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 20 [2022-07-12 18:59:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:25,125 INFO L225 Difference]: With dead ends: 164 [2022-07-12 18:59:25,125 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 18:59:25,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:59:25,126 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 183 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:25,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 325 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 18:59:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-07-12 18:59:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 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) [2022-07-12 18:59:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2022-07-12 18:59:25,129 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 20 [2022-07-12 18:59:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:25,129 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2022-07-12 18:59:25,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) [2022-07-12 18:59:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-07-12 18:59:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:59:25,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:25,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:25,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:59:25,130 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2022-07-12 18:59:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:25,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906423435] [2022-07-12 18:59:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:25,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906423435] [2022-07-12 18:59:25,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906423435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:25,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:25,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:59:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588230214] [2022-07-12 18:59:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:59:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:25,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:59:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:59:25,265 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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) [2022-07-12 18:59:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:25,685 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2022-07-12 18:59:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:59:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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 20 [2022-07-12 18:59:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:25,686 INFO L225 Difference]: With dead ends: 182 [2022-07-12 18:59:25,686 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 18:59:25,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:59:25,687 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 233 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:25,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 391 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:59:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 18:59:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2022-07-12 18:59:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 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) [2022-07-12 18:59:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-07-12 18:59:25,689 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 20 [2022-07-12 18:59:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:25,690 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-07-12 18:59:25,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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) [2022-07-12 18:59:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-07-12 18:59:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:59:25,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:25,696 INFO L195 NwaCegarLoop]: 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] [2022-07-12 18:59:25,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:59:25,697 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:25,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2022-07-12 18:59:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:25,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239866344] [2022-07-12 18:59:25,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239866344] [2022-07-12 18:59:25,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239866344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:25,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002182452] [2022-07-12 18:59:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:25,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:25,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:25,756 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) [2022-07-12 18:59:25,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:59:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:25,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 18:59:25,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:25,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:25,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:26,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:26,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:26,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:26,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:26,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:26,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:26,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:26,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:26,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:26,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:26,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:26,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002182452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:26,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:26,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-07-12 18:59:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718598313] [2022-07-12 18:59:26,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:26,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:59:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:26,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:59:26,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:59:26,243 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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) [2022-07-12 18:59:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:26,595 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2022-07-12 18:59:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:59:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 25 [2022-07-12 18:59:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:26,596 INFO L225 Difference]: With dead ends: 219 [2022-07-12 18:59:26,596 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 18:59:26,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:59:26,596 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 340 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:26,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 424 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 18:59:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 175. [2022-07-12 18:59:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 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) [2022-07-12 18:59:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2022-07-12 18:59:26,599 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 25 [2022-07-12 18:59:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:26,599 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2022-07-12 18:59:26,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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) [2022-07-12 18:59:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2022-07-12 18:59:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:59:26,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:26,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:26,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:26,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 18:59:26,807 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:26,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:26,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2022-07-12 18:59:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:26,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26220715] [2022-07-12 18:59:26,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:26,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:26,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26220715] [2022-07-12 18:59:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26220715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:26,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:59:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821924113] [2022-07-12 18:59:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:26,864 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-12 18:59:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:26,966 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2022-07-12 18:59:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:59:26,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2022-07-12 18:59:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:26,967 INFO L225 Difference]: With dead ends: 179 [2022-07-12 18:59:26,967 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 18:59:26,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:59:26,968 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 25 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:26,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 354 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 18:59:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2022-07-12 18:59:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 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) [2022-07-12 18:59:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2022-07-12 18:59:26,971 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 25 [2022-07-12 18:59:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:26,971 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2022-07-12 18:59:26,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-12 18:59:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2022-07-12 18:59:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:59:26,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:26,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:26,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:59:26,972 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2022-07-12 18:59:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:26,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88202515] [2022-07-12 18:59:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:27,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88202515] [2022-07-12 18:59:27,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88202515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:27,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:27,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380391733] [2022-07-12 18:59:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:27,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:27,015 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-07-12 18:59:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:27,100 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2022-07-12 18:59:27,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:27,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2022-07-12 18:59:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:27,101 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:59:27,101 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 18:59:27,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:27,101 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 20 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:27,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 300 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 18:59:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2022-07-12 18:59:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 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) [2022-07-12 18:59:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2022-07-12 18:59:27,104 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 26 [2022-07-12 18:59:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:27,104 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2022-07-12 18:59:27,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-07-12 18:59:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2022-07-12 18:59:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:59:27,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:27,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:27,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:59:27,106 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2022-07-12 18:59:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:27,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076824912] [2022-07-12 18:59:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:27,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076824912] [2022-07-12 18:59:27,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076824912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:27,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:27,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934040382] [2022-07-12 18:59:27,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:27,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:27,143 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-07-12 18:59:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:27,248 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2022-07-12 18:59:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:59:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2022-07-12 18:59:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:27,249 INFO L225 Difference]: With dead ends: 171 [2022-07-12 18:59:27,249 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 18:59:27,249 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:27,250 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:27,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 327 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 18:59:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-12 18:59:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 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) [2022-07-12 18:59:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2022-07-12 18:59:27,252 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 28 [2022-07-12 18:59:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:27,253 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2022-07-12 18:59:27,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-07-12 18:59:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-07-12 18:59:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:59:27,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:27,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:27,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:59:27,254 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2022-07-12 18:59:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039161923] [2022-07-12 18:59:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039161923] [2022-07-12 18:59:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039161923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:27,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:27,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524754855] [2022-07-12 18:59:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:27,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:59:27,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:59:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:27,333 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-07-12 18:59:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:27,443 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-07-12 18:59:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:59:27,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2022-07-12 18:59:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:27,445 INFO L225 Difference]: With dead ends: 170 [2022-07-12 18:59:27,445 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 18:59:27,445 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:27,445 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:27,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 18:59:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-12 18:59:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 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) [2022-07-12 18:59:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2022-07-12 18:59:27,448 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 28 [2022-07-12 18:59:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:27,448 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2022-07-12 18:59:27,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-07-12 18:59:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2022-07-12 18:59:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:59:27,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:27,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:59:27,451 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:27,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2022-07-12 18:59:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046263318] [2022-07-12 18:59:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:27,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046263318] [2022-07-12 18:59:27,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046263318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:27,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:27,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:59:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994164805] [2022-07-12 18:59:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:27,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:59:27,500 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2022-07-12 18:59:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:27,583 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-07-12 18:59:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:27,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2022-07-12 18:59:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:27,584 INFO L225 Difference]: With dead ends: 169 [2022-07-12 18:59:27,584 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 18:59:27,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:59:27,584 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:27,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 250 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 18:59:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-07-12 18:59:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 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) [2022-07-12 18:59:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2022-07-12 18:59:27,587 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 29 [2022-07-12 18:59:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:27,587 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2022-07-12 18:59:27,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2022-07-12 18:59:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2022-07-12 18:59:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:59:27,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:27,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:27,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:59:27,588 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2022-07-12 18:59:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:27,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931014347] [2022-07-12 18:59:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:27,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:27,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931014347] [2022-07-12 18:59:27,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931014347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:27,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:27,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:59:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617164424] [2022-07-12 18:59:27,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:27,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:59:27,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:27,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:59:27,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:59:27,705 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) [2022-07-12 18:59:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:28,114 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2022-07-12 18:59:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:59:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 31 [2022-07-12 18:59:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:28,115 INFO L225 Difference]: With dead ends: 205 [2022-07-12 18:59:28,115 INFO L226 Difference]: Without dead ends: 205 [2022-07-12 18:59:28,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:59:28,116 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 481 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:28,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 299 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-12 18:59:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2022-07-12 18:59:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 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) [2022-07-12 18:59:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2022-07-12 18:59:28,119 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 31 [2022-07-12 18:59:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:28,119 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2022-07-12 18:59:28,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) [2022-07-12 18:59:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2022-07-12 18:59:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:59:28,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:28,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:28,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 18:59:28,120 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2022-07-12 18:59:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:28,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682693737] [2022-07-12 18:59:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:28,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:28,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682693737] [2022-07-12 18:59:28,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682693737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:28,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278028478] [2022-07-12 18:59:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:28,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:28,169 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) [2022-07-12 18:59:28,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:59:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:28,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:59:28,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:28,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:28,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278028478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:28,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:59:28,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-07-12 18:59:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931138318] [2022-07-12 18:59:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:28,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:28,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:28,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:28,385 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-07-12 18:59:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:28,416 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-12 18:59:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2022-07-12 18:59:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:28,417 INFO L225 Difference]: With dead ends: 169 [2022-07-12 18:59:28,417 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 18:59:28,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:28,418 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 72 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:28,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 127 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:59:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 18:59:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-12 18:59:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 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) [2022-07-12 18:59:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2022-07-12 18:59:28,420 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 31 [2022-07-12 18:59:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:28,421 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2022-07-12 18:59:28,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-07-12 18:59:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-07-12 18:59:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:59:28,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:28,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:28,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:28,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-12 18:59:28,635 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:28,636 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2022-07-12 18:59:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:28,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822498297] [2022-07-12 18:59:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:28,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:28,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822498297] [2022-07-12 18:59:28,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822498297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:28,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:28,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:59:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997566118] [2022-07-12 18:59:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:28,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:59:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:59:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:59:28,702 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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) [2022-07-12 18:59:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:28,920 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-12 18:59:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:59:28,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2022-07-12 18:59:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:28,921 INFO L225 Difference]: With dead ends: 169 [2022-07-12 18:59:28,921 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 18:59:28,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:59:28,922 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 59 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:28,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 374 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 18:59:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-07-12 18:59:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 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) [2022-07-12 18:59:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2022-07-12 18:59:28,925 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 32 [2022-07-12 18:59:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:28,925 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2022-07-12 18:59:28,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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) [2022-07-12 18:59:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2022-07-12 18:59:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:59:28,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:28,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:28,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:59:28,926 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2022-07-12 18:59:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628258260] [2022-07-12 18:59:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:29,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628258260] [2022-07-12 18:59:29,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628258260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:29,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:29,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:59:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583183232] [2022-07-12 18:59:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:29,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:59:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:59:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:29,060 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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) [2022-07-12 18:59:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:29,265 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-07-12 18:59:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:59:29,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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 32 [2022-07-12 18:59:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:29,266 INFO L225 Difference]: With dead ends: 164 [2022-07-12 18:59:29,266 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 18:59:29,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:59:29,267 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 73 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:29,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 377 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:59:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 18:59:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2022-07-12 18:59:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 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) [2022-07-12 18:59:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2022-07-12 18:59:29,269 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 32 [2022-07-12 18:59:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:29,269 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2022-07-12 18:59:29,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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) [2022-07-12 18:59:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2022-07-12 18:59:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:59:29,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:29,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:29,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:59:29,270 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2022-07-12 18:59:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538001479] [2022-07-12 18:59:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:29,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:29,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538001479] [2022-07-12 18:59:29,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538001479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:29,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339977446] [2022-07-12 18:59:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:29,316 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) [2022-07-12 18:59:29,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:59:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:59:29,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:29,419 INFO L390 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 [2022-07-12 18:59:29,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:29,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:59:29,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339977446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:29,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:59:29,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 18:59:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424185248] [2022-07-12 18:59:29,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:29,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:59:29,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:59:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:59:29,446 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2022-07-12 18:59:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:29,498 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-07-12 18:59:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:59:29,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2022-07-12 18:59:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:29,499 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:59:29,499 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:59:29,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:59:29,500 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:29,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 278 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:59:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:59:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2022-07-12 18:59:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 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) [2022-07-12 18:59:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2022-07-12 18:59:29,502 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 33 [2022-07-12 18:59:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:29,502 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2022-07-12 18:59:29,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2022-07-12 18:59:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2022-07-12 18:59:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:59:29,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:29,503 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:29,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:29,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:29,718 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2022-07-12 18:59:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:29,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825746370] [2022-07-12 18:59:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:29,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825746370] [2022-07-12 18:59:29,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825746370] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:29,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783935306] [2022-07-12 18:59:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:29,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:29,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:59:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:29,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:59:29,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:29,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:29,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:30,006 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:59:30,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:30,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:30,035 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:59:30,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:30,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:30,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:30,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:59:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:30,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:30,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783935306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:30,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:30,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2022-07-12 18:59:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083925456] [2022-07-12 18:59:30,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:30,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:59:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:30,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:59:30,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:59:30,244 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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) [2022-07-12 18:59:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:30,628 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2022-07-12 18:59:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:59:30,628 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 34 [2022-07-12 18:59:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:30,629 INFO L225 Difference]: With dead ends: 210 [2022-07-12 18:59:30,629 INFO L226 Difference]: Without dead ends: 210 [2022-07-12 18:59:30,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:59:30,629 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 338 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:30,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 487 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:59:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-12 18:59:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 166. [2022-07-12 18:59:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 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) [2022-07-12 18:59:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2022-07-12 18:59:30,632 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 34 [2022-07-12 18:59:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:30,632 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2022-07-12 18:59:30,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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) [2022-07-12 18:59:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2022-07-12 18:59:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:59:30,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:30,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:30,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:30,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:30,839 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash 572484842, now seen corresponding path program 1 times [2022-07-12 18:59:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:30,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611330010] [2022-07-12 18:59:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:59:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611330010] [2022-07-12 18:59:30,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611330010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:30,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:30,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:59:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025521283] [2022-07-12 18:59:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:30,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:59:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:59:30,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:59:30,874 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-12 18:59:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:30,927 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-07-12 18:59:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:59:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2022-07-12 18:59:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:30,928 INFO L225 Difference]: With dead ends: 165 [2022-07-12 18:59:30,928 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 18:59:30,928 INFO L412 NwaCegarLoop]: 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 [2022-07-12 18:59:30,929 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:30,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:59:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 18:59:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-12 18:59:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 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) [2022-07-12 18:59:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2022-07-12 18:59:30,931 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 35 [2022-07-12 18:59:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:30,931 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2022-07-12 18:59:30,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-12 18:59:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2022-07-12 18:59:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:59:30,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:30,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:30,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 18:59:30,931 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 402130029, now seen corresponding path program 1 times [2022-07-12 18:59:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:30,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570588228] [2022-07-12 18:59:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:31,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570588228] [2022-07-12 18:59:31,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570588228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:31,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722442642] [2022-07-12 18:59:31,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:31,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:31,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:31,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:59:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:31,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:59:31,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:31,208 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:31,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 18 treesize of output 32 [2022-07-12 18:59:31,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2022-07-12 18:59:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:31,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:59:31,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722442642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:31,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:31,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-07-12 18:59:31,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799911817] [2022-07-12 18:59:31,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:31,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:59:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:59:31,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:59:31,638 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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) [2022-07-12 18:59:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:31,910 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-07-12 18:59:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:59:31,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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 37 [2022-07-12 18:59:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:31,911 INFO L225 Difference]: With dead ends: 175 [2022-07-12 18:59:31,911 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 18:59:31,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:59:31,912 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 66 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:31,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 524 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 272 Invalid, 0 Unknown, 186 Unchecked, 0.2s Time] [2022-07-12 18:59:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 18:59:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-12 18:59:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 149 states have internal predecessors, (159), 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) [2022-07-12 18:59:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2022-07-12 18:59:31,914 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 37 [2022-07-12 18:59:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:31,914 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2022-07-12 18:59:31,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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) [2022-07-12 18:59:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2022-07-12 18:59:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:59:31,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:31,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:31,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:32,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:59:32,116 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash -426569403, now seen corresponding path program 1 times [2022-07-12 18:59:32,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:32,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909115178] [2022-07-12 18:59:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:32,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909115178] [2022-07-12 18:59:32,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909115178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:32,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738354978] [2022-07-12 18:59:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:32,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:32,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:32,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:59:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:32,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:59:32,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:32,520 INFO L390 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 [2022-07-12 18:59:32,531 INFO L390 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 [2022-07-12 18:59:32,570 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:32,571 INFO L390 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 [2022-07-12 18:59:32,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:32,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:32,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:32,683 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:32,684 INFO L390 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 29 treesize of output 30 [2022-07-12 18:59:32,686 INFO L390 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 20 treesize of output 22 [2022-07-12 18:59:32,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:59:32,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:32,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:32,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:32,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:32,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:32,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:32,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:32,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1581 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1582) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1581) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:32,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1581 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1582) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1581) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1584)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:32,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:32,828 INFO L390 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 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-12 18:59:32,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-07-12 18:59:32,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-12 18:59:32,848 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1578 Int)) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (forall ((v_arrayElimCell_25 Int) (v_ArrVal_1582 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1582) v_arrayElimCell_25 v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))) (or .cse0 (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1578 Int)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (or (not .cse0) (forall ((v_arrayElimCell_25 Int) (v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1578 Int) (v_ArrVal_1582 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1582) v_arrayElimCell_25 v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2022-07-12 18:59:34,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:59:34,998 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 18:59:34,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 18:59:35,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:35,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 18:59:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738354978] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:35,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 34 [2022-07-12 18:59:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755500001] [2022-07-12 18:59:35,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:35,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 18:59:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 18:59:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=635, Unknown=9, NotChecked=342, Total=1122 [2022-07-12 18:59:35,025 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 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) [2022-07-12 18:59:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:35,760 INFO L93 Difference]: Finished difference Result 360 states and 384 transitions. [2022-07-12 18:59:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:59:35,761 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 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 39 [2022-07-12 18:59:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:35,762 INFO L225 Difference]: With dead ends: 360 [2022-07-12 18:59:35,762 INFO L226 Difference]: Without dead ends: 360 [2022-07-12 18:59:35,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=252, Invalid=1169, Unknown=9, NotChecked=462, Total=1892 [2022-07-12 18:59:35,762 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 396 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1225 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:35,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 805 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 982 Invalid, 0 Unknown, 1225 Unchecked, 0.4s Time] [2022-07-12 18:59:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-12 18:59:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 176. [2022-07-12 18:59:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 152 states have (on average 1.230263157894737) internal successors, (187), 175 states have internal predecessors, (187), 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) [2022-07-12 18:59:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2022-07-12 18:59:35,765 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 39 [2022-07-12 18:59:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:35,765 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2022-07-12 18:59:35,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 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) [2022-07-12 18:59:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2022-07-12 18:59:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:59:35,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:35,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:35,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:35,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 18:59:35,975 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 268919448, now seen corresponding path program 1 times [2022-07-12 18:59:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:35,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693464776] [2022-07-12 18:59:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:36,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693464776] [2022-07-12 18:59:36,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693464776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:59:36,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:59:36,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 18:59:36,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531698360] [2022-07-12 18:59:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:59:36,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:59:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:59:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:59:36,186 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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) [2022-07-12 18:59:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:36,822 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2022-07-12 18:59:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:59:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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 41 [2022-07-12 18:59:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:36,823 INFO L225 Difference]: With dead ends: 190 [2022-07-12 18:59:36,823 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 18:59:36,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2022-07-12 18:59:36,824 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 324 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:36,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 569 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:59:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 18:59:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 167. [2022-07-12 18:59:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 166 states have internal predecessors, (178), 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) [2022-07-12 18:59:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2022-07-12 18:59:36,827 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 41 [2022-07-12 18:59:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:36,827 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2022-07-12 18:59:36,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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) [2022-07-12 18:59:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2022-07-12 18:59:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:59:36,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:36,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:36,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 18:59:36,829 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1035696014, now seen corresponding path program 1 times [2022-07-12 18:59:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:36,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446411079] [2022-07-12 18:59:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:36,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446411079] [2022-07-12 18:59:36,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446411079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924829495] [2022-07-12 18:59:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:36,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:36,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:36,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:59:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:37,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 18:59:37,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:37,126 INFO L390 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 [2022-07-12 18:59:37,173 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:59:37,174 INFO L390 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 [2022-07-12 18:59:37,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:37,271 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:37,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 18:59:37,334 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:37,334 INFO L390 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 31 treesize of output 29 [2022-07-12 18:59:37,359 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:37,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 18:59:37,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 18:59:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:37,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:37,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-07-12 18:59:37,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1815)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-07-12 18:59:37,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1815)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-07-12 18:59:37,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:37,628 INFO L390 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 1 case distinctions, treesize of input 38 treesize of output 31 [2022-07-12 18:59:37,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:37,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-07-12 18:59:37,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-07-12 18:59:37,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:37,654 INFO L390 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 204 treesize of output 196 [2022-07-12 18:59:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:42,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924829495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:42,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:42,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 31 [2022-07-12 18:59:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748118600] [2022-07-12 18:59:42,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:42,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 18:59:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 18:59:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=659, Unknown=15, NotChecked=168, Total=992 [2022-07-12 18:59:42,273 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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) [2022-07-12 18:59:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:42,653 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2022-07-12 18:59:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:59:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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 46 [2022-07-12 18:59:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:42,654 INFO L225 Difference]: With dead ends: 182 [2022-07-12 18:59:42,654 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 18:59:42,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=244, Invalid=875, Unknown=15, NotChecked=198, Total=1332 [2022-07-12 18:59:42,655 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 158 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 791 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:42,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 733 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 570 Invalid, 0 Unknown, 791 Unchecked, 0.2s Time] [2022-07-12 18:59:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 18:59:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2022-07-12 18:59:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.236842105263158) internal successors, (188), 174 states have internal predecessors, (188), 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) [2022-07-12 18:59:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2022-07-12 18:59:42,657 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 46 [2022-07-12 18:59:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:42,657 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2022-07-12 18:59:42,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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) [2022-07-12 18:59:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2022-07-12 18:59:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:59:42,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:42,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:42,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 18:59:42,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:42,859 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:42,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1035696015, now seen corresponding path program 1 times [2022-07-12 18:59:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:42,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675113320] [2022-07-12 18:59:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675113320] [2022-07-12 18:59:43,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675113320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773929772] [2022-07-12 18:59:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:43,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:43,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:43,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:59:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:43,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 18:59:43,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:43,203 INFO L390 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 [2022-07-12 18:59:43,247 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:43,248 INFO L390 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 [2022-07-12 18:59:43,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:43,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:43,324 INFO L390 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 19 treesize of output 22 [2022-07-12 18:59:43,379 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:43,380 INFO L390 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 22 treesize of output 22 [2022-07-12 18:59:43,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:43,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:59:43,436 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:43,436 INFO L390 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 44 treesize of output 43 [2022-07-12 18:59:43,448 INFO L390 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 33 treesize of output 33 [2022-07-12 18:59:43,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-12 18:59:43,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 18:59:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:43,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:43,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:43,784 INFO L390 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 43 treesize of output 47 [2022-07-12 18:59:43,800 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8))) (forall ((v_ArrVal_1955 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1955) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (forall ((v_ArrVal_1954 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1954) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-12 18:59:43,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:43,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-07-12 18:59:43,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:59:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:44,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773929772] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:59:44,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:59:44,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2022-07-12 18:59:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598890637] [2022-07-12 18:59:44,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:44,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 18:59:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:59:44,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 18:59:44,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=4, NotChecked=68, Total=1332 [2022-07-12 18:59:44,150 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 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) [2022-07-12 18:59:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:45,064 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2022-07-12 18:59:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:59:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 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 46 [2022-07-12 18:59:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:45,065 INFO L225 Difference]: With dead ends: 247 [2022-07-12 18:59:45,065 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 18:59:45,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=1985, Unknown=4, NotChecked=92, Total=2352 [2022-07-12 18:59:45,066 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 433 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:45,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 899 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1122 Invalid, 0 Unknown, 499 Unchecked, 0.5s Time] [2022-07-12 18:59:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 18:59:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2022-07-12 18:59:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.232258064516129) internal successors, (191), 177 states have internal predecessors, (191), 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) [2022-07-12 18:59:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2022-07-12 18:59:45,069 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 46 [2022-07-12 18:59:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:45,069 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2022-07-12 18:59:45,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 states have internal predecessors, (128), 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) [2022-07-12 18:59:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2022-07-12 18:59:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 18:59:45,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:59:45,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:45,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 18:59:45,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:45,270 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 18:59:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:59:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1558963792, now seen corresponding path program 1 times [2022-07-12 18:59:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:59:45,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683880013] [2022-07-12 18:59:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:59:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:59:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683880013] [2022-07-12 18:59:45,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683880013] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132894182] [2022-07-12 18:59:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:59:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:59:45,789 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:59:45,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:59:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:45,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 18:59:45,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:45,971 INFO L390 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 [2022-07-12 18:59:45,981 INFO L390 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 [2022-07-12 18:59:46,021 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:59:46,021 INFO L390 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 [2022-07-12 18:59:46,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:59:46,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:59:46,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:46,113 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:46,114 INFO L390 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 29 treesize of output 30 [2022-07-12 18:59:46,116 INFO L390 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 20 treesize of output 22 [2022-07-12 18:59:46,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:59:46,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:46,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:46,238 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 18:59:46,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:46,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:46,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:59:46,349 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:59:46,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-12 18:59:46,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 18:59:46,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 18:59:46,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:46,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:59:46,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:59:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:59:46,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:46,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:46,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:46,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:46,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2155) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-07-12 18:59:46,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_2155) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2157)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-07-12 18:59:46,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:46,512 INFO L390 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 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-12 18:59:46,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-07-12 18:59:46,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-12 18:59:46,530 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_2155 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2155) v_arrayElimCell_72 v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2155) v_arrayElimCell_72 v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2022-07-12 18:59:46,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:59:46,816 INFO L390 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 1 case distinctions, treesize of input 63 treesize of output 55 [2022-07-12 18:59:46,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2022-07-12 18:59:46,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-07-12 18:59:46,856 INFO L356 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-07-12 18:59:46,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2022-07-12 18:59:46,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or (forall ((v_arrayElimCell_74 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_74 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_74) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (not .cse0)) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_arrayElimCell_74 Int) (v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (forall ((v_ArrVal_2147 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_74 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) .cse0) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|) (forall ((v_arrayElimCell_74 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_74) (forall ((v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (forall ((v_ArrVal_2147 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_74 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))))))))) is different from false [2022-07-12 19:00:05,441 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:00:05,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:05,487 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 19:00:05,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2022-07-12 19:00:05,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:05,492 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 19:00:05,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2022-07-12 19:00:05,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:05,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:05,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2022-07-12 19:00:05,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:05,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 141 [2022-07-12 19:00:05,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2022-07-12 19:00:05,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-12 19:00:05,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:00:05,537 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 19:00:05,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 1 [2022-07-12 19:00:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:05,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132894182] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:00:05,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:00:05,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 21] total 54 [2022-07-12 19:00:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503384844] [2022-07-12 19:00:05,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:00:05,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-12 19:00:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:00:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-12 19:00:05,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1850, Unknown=29, NotChecked=672, Total=2862 [2022-07-12 19:00:05,571 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 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) [2022-07-12 19:00:07,675 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (or (forall ((v_arrayElimCell_74 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_74 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_74) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (not .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select .cse1 .cse2) ~unnamed1~0~BLACK) (<= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) (= ~unnamed1~0~BLACK (select .cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= ~unnamed1~0~BLACK (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_arrayElimCell_74 Int) (v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (forall ((v_ArrVal_2147 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_74 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) .cse0) (not (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse2)) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|) (forall ((v_arrayElimCell_74 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_74) (forall ((v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (forall ((v_ArrVal_2147 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_74 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2022-07-12 19:00:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:00:08,797 INFO L93 Difference]: Finished difference Result 477 states and 512 transitions. [2022-07-12 19:00:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 19:00:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 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 49 [2022-07-12 19:00:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:00:08,798 INFO L225 Difference]: With dead ends: 477 [2022-07-12 19:00:08,798 INFO L226 Difference]: Without dead ends: 477 [2022-07-12 19:00:08,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=612, Invalid=3296, Unknown=30, NotChecked=1032, Total=4970 [2022-07-12 19:00:08,799 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 652 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 3915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2336 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:00:08,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1278 Invalid, 3915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1467 Invalid, 0 Unknown, 2336 Unchecked, 0.6s Time] [2022-07-12 19:00:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-07-12 19:00:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 204. [2022-07-12 19:00:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.2044198895027625) internal successors, (218), 203 states have internal predecessors, (218), 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) [2022-07-12 19:00:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2022-07-12 19:00:08,803 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 49 [2022-07-12 19:00:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:00:08,803 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2022-07-12 19:00:08,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 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) [2022-07-12 19:00:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2022-07-12 19:00:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:00:08,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:00:08,803 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:00:08,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:00:09,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:00:09,004 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-12 19:00:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:00:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 775361098, now seen corresponding path program 2 times [2022-07-12 19:00:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:00:09,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989285738] [2022-07-12 19:00:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:00:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:00:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:00:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:09,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:00:09,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989285738] [2022-07-12 19:00:09,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989285738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:00:09,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652323897] [2022-07-12 19:00:09,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:00:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:00:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:00:09,332 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:00:09,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:00:09,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:00:09,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:00:09,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 19:00:09,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:00:09,541 INFO L390 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 [2022-07-12 19:00:09,602 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:00:09,602 INFO L390 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 [2022-07-12 19:00:09,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:09,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:09,710 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:09,710 INFO L390 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 29 treesize of output 30 [2022-07-12 19:00:09,713 INFO L390 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 18 treesize of output 20 [2022-07-12 19:00:09,793 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:09,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 19:00:09,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:09,809 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:09,809 INFO L390 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 22 treesize of output 22 [2022-07-12 19:00:09,871 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:00:09,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 19:00:09,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:00:09,887 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:00:09,888 INFO L390 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 22 treesize of output 22 [2022-07-12 19:00:10,232 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:00:10,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-12 19:00:10,234 INFO L390 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-12 19:00:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:00:10,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:00:10,470 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int))) (or (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|)) (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2299))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2300))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select v_ArrVal_2300 |c_ULTIMATE.start_main_~end~0#1.offset|))) (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|))))) is different from false [2022-07-12 19:00:10,499 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2299))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_#t~mem6#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|)))) (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (select v_ArrVal_2300 |c_ULTIMATE.start_main_#t~mem6#1.offset|) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2300))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_#t~mem6#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|))))) is different from false [2022-07-12 19:00:10,509 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2299))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (select v_ArrVal_2300 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2300))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))))))) is different from false [2022-07-12 19:00:10,528 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (or (not (= (select v_ArrVal_2299 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2296) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) |c_ULTIMATE.start_main_~null~0#1.offset|)) (forall ((v_ArrVal_2300 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2296))) (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2295))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_2300))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse3 .cse2 v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (select v_ArrVal_2300 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (or (not (= (select v_ArrVal_2299 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2296) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) |c_ULTIMATE.start_main_~null~0#1.offset|)) (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2295))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2296) .cse6 v_ArrVal_2299))) (select (select .cse4 (select (select (store .cse5 .cse6 v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))))) is different from false [2022-07-12 19:00:10,541 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2295))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2296) .cse2 v_ArrVal_2299))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2296) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_2296))) (= (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_2295))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse4 (store .cse5 .cse6 v_ArrVal_2300))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse7 .cse6 v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (select v_ArrVal_2300 (select (select .cse7 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2296) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))))))) is different from false [2022-07-12 19:00:10,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:10,576 INFO L390 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 1 case distinctions, treesize of input 141 treesize of output 125 [2022-07-12 19:00:10,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:10,580 INFO L390 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 1 case distinctions, treesize of input 103 treesize of output 72 [2022-07-12 19:00:10,835 INFO L356 Elim1Store]: treesize reduction 154, result has 69.8 percent of original size [2022-07-12 19:00:10,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 4342 treesize of output 3475 [2022-07-12 19:00:10,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:10,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5271 treesize of output 4914 [2022-07-12 19:00:11,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:11,056 INFO L390 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 4675 treesize of output 4549 [2022-07-12 19:00:11,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:11,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4705 treesize of output 4617 [2022-07-12 19:00:11,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:11,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4034 treesize of output 3722 [2022-07-12 19:00:11,371 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:00:11,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4095 treesize of output 3797