./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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-queue-1.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 c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:13:47,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:13:47,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:13:47,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:13:47,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:13:47,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:13:47,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:13:47,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:13:47,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:13:47,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:13:47,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:13:47,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:13:47,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:13:47,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:13:47,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:13:47,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:13:47,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:13:47,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:13:47,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:13:47,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:13:47,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:13:47,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:13:47,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:13:47,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:13:47,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:13:47,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:13:47,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:13:47,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:13:47,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:13:47,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:13:47,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:13:47,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:13:47,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:13:47,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:13:47,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:13:47,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:13:47,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:13:47,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:13:47,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:13:47,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:13:47,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:13:47,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:13:47,252 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:13:47,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:13:47,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:13:47,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:13:47,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:13:47,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:13:47,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:13:47,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:13:47,254 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:13:47,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:13:47,255 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:13:47,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:13:47,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:13:47,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:13:47,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:13:47,255 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:13:47,256 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:13:47,256 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:13:47,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:13:47,256 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:13:47,256 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:13:47,256 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:13:47,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:13:47,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:13:47,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:13:47,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:13:47,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:13:47,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:13:47,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:13:47,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:13:47,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:13:47,258 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:13:47,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:13:47,258 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:13:47,259 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2023-02-15 22:13:47,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:13:47,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:13:47,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:13:47,425 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:13:47,425 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:13:47,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-02-15 22:13:48,406 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:13:48,601 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:13:48,602 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i [2023-02-15 22:13:48,616 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88483affb/a4ed0133b11343d1b5453aa39a89f9ab/FLAGd2a3d47e3 [2023-02-15 22:13:48,951 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88483affb/a4ed0133b11343d1b5453aa39a89f9ab [2023-02-15 22:13:48,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:13:48,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:13:48,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:13:48,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:13:48,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:13:48,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:13:48" (1/1) ... [2023-02-15 22:13:48,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76224382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:48, skipping insertion in model container [2023-02-15 22:13:48,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:13:48" (1/1) ... [2023-02-15 22:13:48,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:13:49,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:13:49,226 WARN L237 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-queue-1.i[22460,22473] [2023-02-15 22:13:49,230 WARN L237 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-queue-1.i[22531,22544] [2023-02-15 22:13:49,232 WARN L237 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-queue-1.i[22605,22618] [2023-02-15 22:13:49,234 WARN L237 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-queue-1.i[22697,22710] [2023-02-15 22:13:49,234 WARN L237 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-queue-1.i[22774,22787] [2023-02-15 22:13:49,235 WARN L237 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-queue-1.i[22869,22882] [2023-02-15 22:13:49,236 WARN L237 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-queue-1.i[22946,22959] [2023-02-15 22:13:49,237 WARN L237 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-queue-1.i[23029,23042] [2023-02-15 22:13:49,238 WARN L237 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-queue-1.i[23124,23137] [2023-02-15 22:13:49,239 WARN L237 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-queue-1.i[23201,23214] [2023-02-15 22:13:49,240 WARN L237 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-queue-1.i[23284,23297] [2023-02-15 22:13:49,242 WARN L237 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-queue-1.i[23373,23386] [2023-02-15 22:13:49,243 WARN L237 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-queue-1.i[23459,23472] [2023-02-15 22:13:49,244 WARN L237 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-queue-1.i[23604,23617] [2023-02-15 22:13:49,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:13:49,260 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:13:49,283 WARN L237 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-queue-1.i[22460,22473] [2023-02-15 22:13:49,285 WARN L237 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-queue-1.i[22531,22544] [2023-02-15 22:13:49,286 WARN L237 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-queue-1.i[22605,22618] [2023-02-15 22:13:49,287 WARN L237 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-queue-1.i[22697,22710] [2023-02-15 22:13:49,288 WARN L237 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-queue-1.i[22774,22787] [2023-02-15 22:13:49,290 WARN L237 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-queue-1.i[22869,22882] [2023-02-15 22:13:49,290 WARN L237 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-queue-1.i[22946,22959] [2023-02-15 22:13:49,292 WARN L237 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-queue-1.i[23029,23042] [2023-02-15 22:13:49,293 WARN L237 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-queue-1.i[23124,23137] [2023-02-15 22:13:49,294 WARN L237 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-queue-1.i[23201,23214] [2023-02-15 22:13:49,309 WARN L237 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-queue-1.i[23284,23297] [2023-02-15 22:13:49,310 WARN L237 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-queue-1.i[23373,23386] [2023-02-15 22:13:49,310 WARN L237 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-queue-1.i[23459,23472] [2023-02-15 22:13:49,311 WARN L237 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-queue-1.i[23604,23617] [2023-02-15 22:13:49,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:13:49,329 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:13:49,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49 WrapperNode [2023-02-15 22:13:49,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:13:49,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:13:49,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:13:49,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:13:49,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,385 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 226 [2023-02-15 22:13:49,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:13:49,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:13:49,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:13:49,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:13:49,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,428 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:13:49,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:13:49,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:13:49,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:13:49,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (1/1) ... [2023-02-15 22:13:49,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:13:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:49,470 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) [2023-02-15 22:13:49,477 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 [2023-02-15 22:13:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:13:49,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:13:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:13:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:13:49,563 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:13:49,565 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:13:49,921 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:13:49,930 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:13:49,930 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2023-02-15 22:13:49,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:13:49 BoogieIcfgContainer [2023-02-15 22:13:49,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:13:49,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:13:49,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:13:49,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:13:49,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:13:48" (1/3) ... [2023-02-15 22:13:49,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465e7337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:13:49, skipping insertion in model container [2023-02-15 22:13:49,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:49" (2/3) ... [2023-02-15 22:13:49,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465e7337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:13:49, skipping insertion in model container [2023-02-15 22:13:49,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:13:49" (3/3) ... [2023-02-15 22:13:49,939 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2023-02-15 22:13:49,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:13:49,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2023-02-15 22:13:50,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:13:50,011 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ebf7bbc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:13:50,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2023-02-15 22:13:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 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) [2023-02-15 22:13:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:13:50,022 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:50,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:13:50,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 22:13:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:50,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852427740] [2023-02-15 22:13:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852427740] [2023-02-15 22:13:50,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852427740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:50,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:50,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:13:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056493189] [2023-02-15 22:13:50,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:13:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:13:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:50,224 INFO L87 Difference]: Start difference. First operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 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) [2023-02-15 22:13:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:50,361 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2023-02-15 22:13:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:13:50,363 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 [2023-02-15 22:13:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:50,369 INFO L225 Difference]: With dead ends: 178 [2023-02-15 22:13:50,370 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 22:13:50,371 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 [2023-02-15 22:13:50,373 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 169 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:50,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 22:13:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2023-02-15 22:13:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 169 states have internal predecessors, (182), 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) [2023-02-15 22:13:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2023-02-15 22:13:50,401 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 3 [2023-02-15 22:13:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:50,401 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2023-02-15 22:13:50,401 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) [2023-02-15 22:13:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2023-02-15 22:13:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:13:50,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:50,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:13:50,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:13:50,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 22:13:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976543022] [2023-02-15 22:13:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:50,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976543022] [2023-02-15 22:13:50,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976543022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:50,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:50,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:13:50,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897296591] [2023-02-15 22:13:50,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:50,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:13:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:50,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:13:50,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:50,457 INFO L87 Difference]: Start difference. First operand 170 states and 182 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) [2023-02-15 22:13:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:50,526 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2023-02-15 22:13:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:13:50,527 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 [2023-02-15 22:13:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:50,528 INFO L225 Difference]: With dead ends: 163 [2023-02-15 22:13:50,528 INFO L226 Difference]: Without dead ends: 163 [2023-02-15 22:13:50,528 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 [2023-02-15 22:13:50,529 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:50,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-15 22:13:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2023-02-15 22:13:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.619047619047619) internal successors, (170), 158 states have internal predecessors, (170), 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) [2023-02-15 22:13:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2023-02-15 22:13:50,536 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 3 [2023-02-15 22:13:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:50,536 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2023-02-15 22:13:50,537 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) [2023-02-15 22:13:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2023-02-15 22:13:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:13:50,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:50,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:50,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:13:50,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2023-02-15 22:13:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:50,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18782818] [2023-02-15 22:13:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18782818] [2023-02-15 22:13:50,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18782818] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:50,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:13:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985329217] [2023-02-15 22:13:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:50,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:13:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:13:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:13:50,677 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:50,764 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2023-02-15 22:13:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:13:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:13:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:50,765 INFO L225 Difference]: With dead ends: 168 [2023-02-15 22:13:50,765 INFO L226 Difference]: Without dead ends: 168 [2023-02-15 22:13:50,766 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 [2023-02-15 22:13:50,766 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 272 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:50,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 118 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-15 22:13:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2023-02-15 22:13:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.5625) internal successors, (175), 159 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) [2023-02-15 22:13:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2023-02-15 22:13:50,772 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 9 [2023-02-15 22:13:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:50,773 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2023-02-15 22:13:50,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2023-02-15 22:13:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:13:50,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:50,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:50,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:13:50,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2023-02-15 22:13:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:50,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418115692] [2023-02-15 22:13:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418115692] [2023-02-15 22:13:50,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418115692] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:50,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:50,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:13:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044583122] [2023-02-15 22:13:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:50,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:13:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:13:50,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:13:50,908 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:51,118 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2023-02-15 22:13:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:13:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:13:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:51,120 INFO L225 Difference]: With dead ends: 256 [2023-02-15 22:13:51,120 INFO L226 Difference]: Without dead ends: 256 [2023-02-15 22:13:51,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:13:51,123 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 334 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:51,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 244 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-02-15 22:13:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2023-02-15 22:13:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 167 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) [2023-02-15 22:13:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2023-02-15 22:13:51,148 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 9 [2023-02-15 22:13:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:51,149 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-15 22:13:51,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2023-02-15 22:13:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:13:51,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:51,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:51,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:13:51,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1115899309, now seen corresponding path program 1 times [2023-02-15 22:13:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:51,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438096239] [2023-02-15 22:13:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438096239] [2023-02-15 22:13:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438096239] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:51,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:51,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:13:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190712312] [2023-02-15 22:13:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:13:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:13:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:51,174 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:51,196 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2023-02-15 22:13:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:13:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 22:13:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:51,197 INFO L225 Difference]: With dead ends: 158 [2023-02-15 22:13:51,198 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 22:13:51,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:51,198 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:51,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 141 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:13:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 22:13:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-02-15 22:13:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 157 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) [2023-02-15 22:13:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2023-02-15 22:13:51,202 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 10 [2023-02-15 22:13:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:51,202 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2023-02-15 22:13:51,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2023-02-15 22:13:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:13:51,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:51,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:51,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:13:51,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-15 22:13:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795028779] [2023-02-15 22:13:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:51,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:51,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795028779] [2023-02-15 22:13:51,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795028779] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:51,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:51,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:13:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747674405] [2023-02-15 22:13:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:51,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:13:51,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:51,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:13:51,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:13:51,345 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 22:13:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:51,458 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-02-15 22:13:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:13:51,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-02-15 22:13:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:51,459 INFO L225 Difference]: With dead ends: 157 [2023-02-15 22:13:51,459 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 22:13:51,459 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 [2023-02-15 22:13:51,460 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:51,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 424 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 22:13:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-02-15 22:13:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 156 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) [2023-02-15 22:13:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2023-02-15 22:13:51,463 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2023-02-15 22:13:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:51,463 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2023-02-15 22:13:51,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 22:13:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2023-02-15 22:13:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:13:51,464 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:51,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:51,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:13:51,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-15 22:13:51,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:51,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346137450] [2023-02-15 22:13:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:51,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:51,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346137450] [2023-02-15 22:13:51,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346137450] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:51,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:51,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:13:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076598517] [2023-02-15 22:13:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:51,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:13:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:51,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:13:51,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:13:51,537 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 22:13:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:51,636 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-15 22:13:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:13:51,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2023-02-15 22:13:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:51,637 INFO L225 Difference]: With dead ends: 156 [2023-02-15 22:13:51,637 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 22:13:51,638 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 [2023-02-15 22:13:51,638 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 8 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:51,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 422 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 22:13:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-02-15 22:13:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 155 states have internal predecessors, (170), 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) [2023-02-15 22:13:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-15 22:13:51,641 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 12 [2023-02-15 22:13:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:51,641 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-15 22:13:51,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 22:13:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-15 22:13:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:13:51,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:51,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:13:51,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash -794856606, now seen corresponding path program 1 times [2023-02-15 22:13:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961233009] [2023-02-15 22:13:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961233009] [2023-02-15 22:13:51,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961233009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:51,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:51,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:13:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873538859] [2023-02-15 22:13:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:51,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:13:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:13:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:51,666 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2023-02-15 22:13:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:51,683 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2023-02-15 22:13:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:13:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 [2023-02-15 22:13:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:51,684 INFO L225 Difference]: With dead ends: 208 [2023-02-15 22:13:51,684 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 22:13:51,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:51,685 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:51,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:13:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 22:13:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2023-02-15 22:13:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 163 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) [2023-02-15 22:13:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2023-02-15 22:13:51,688 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 16 [2023-02-15 22:13:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:51,688 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2023-02-15 22:13:51,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2023-02-15 22:13:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2023-02-15 22:13:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:13:51,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:51,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:51,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:13:51,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-15 22:13:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:51,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280935305] [2023-02-15 22:13:51,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280935305] [2023-02-15 22:13:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280935305] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:51,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:13:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273223299] [2023-02-15 22:13:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:51,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:13:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:13:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:13:51,831 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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) [2023-02-15 22:13:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:52,088 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2023-02-15 22:13:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:13:52,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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 [2023-02-15 22:13:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:52,089 INFO L225 Difference]: With dead ends: 167 [2023-02-15 22:13:52,089 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 22:13:52,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:13:52,090 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 252 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:52,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 521 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 22:13:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2023-02-15 22:13:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 162 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) [2023-02-15 22:13:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2023-02-15 22:13:52,093 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 16 [2023-02-15 22:13:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:52,093 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2023-02-15 22:13:52,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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) [2023-02-15 22:13:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2023-02-15 22:13:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:13:52,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:52,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:52,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:13:52,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-15 22:13:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:52,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817700988] [2023-02-15 22:13:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:52,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817700988] [2023-02-15 22:13:52,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817700988] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:52,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:52,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:13:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659123197] [2023-02-15 22:13:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:13:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:13:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:13:52,292 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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) [2023-02-15 22:13:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:52,681 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2023-02-15 22:13:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:13:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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 [2023-02-15 22:13:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:52,683 INFO L225 Difference]: With dead ends: 162 [2023-02-15 22:13:52,683 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 22:13:52,683 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 [2023-02-15 22:13:52,683 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 333 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 398 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 22:13:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2023-02-15 22:13:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 155 states have internal predecessors, (170), 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) [2023-02-15 22:13:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-15 22:13:52,686 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 16 [2023-02-15 22:13:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:52,687 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-15 22:13:52,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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) [2023-02-15 22:13:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-15 22:13:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:13:52,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:52,687 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] [2023-02-15 22:13:52,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:13:52,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1461793571, now seen corresponding path program 1 times [2023-02-15 22:13:52,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383658207] [2023-02-15 22:13:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:52,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383658207] [2023-02-15 22:13:52,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383658207] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:52,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:52,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:13:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498375248] [2023-02-15 22:13:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:52,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:13:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:13:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:52,707 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-02-15 22:13:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:52,712 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2023-02-15 22:13:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:13:52,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 22:13:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:52,713 INFO L225 Difference]: With dead ends: 157 [2023-02-15 22:13:52,713 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 22:13:52,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:52,714 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:52,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:13:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 22:13:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-02-15 22:13:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 156 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) [2023-02-15 22:13:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2023-02-15 22:13:52,717 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 21 [2023-02-15 22:13:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:52,717 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2023-02-15 22:13:52,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-02-15 22:13:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2023-02-15 22:13:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:13:52,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:52,718 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] [2023-02-15 22:13:52,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:13:52,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1463640613, now seen corresponding path program 1 times [2023-02-15 22:13:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:52,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007480911] [2023-02-15 22:13:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007480911] [2023-02-15 22:13:52,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007480911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:52,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:52,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:13:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333013413] [2023-02-15 22:13:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:13:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:13:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:13:52,837 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) [2023-02-15 22:13:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:52,917 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2023-02-15 22:13:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:13:52,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 22:13:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:52,918 INFO L225 Difference]: With dead ends: 165 [2023-02-15 22:13:52,918 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 22:13:52,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:13:52,919 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 13 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:52,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 589 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 22:13:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2023-02-15 22:13:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3671875) internal successors, (175), 160 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) [2023-02-15 22:13:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2023-02-15 22:13:52,922 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 21 [2023-02-15 22:13:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:52,922 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2023-02-15 22:13:52,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) [2023-02-15 22:13:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2023-02-15 22:13:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:13:52,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:52,923 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] [2023-02-15 22:13:52,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:13:52,923 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -348511767, now seen corresponding path program 1 times [2023-02-15 22:13:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735456954] [2023-02-15 22:13:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735456954] [2023-02-15 22:13:52,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735456954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:52,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:52,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:13:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583817965] [2023-02-15 22:13:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:52,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:13:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:13:52,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:13:52,962 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-02-15 22:13:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:53,014 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2023-02-15 22:13:53,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:13:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2023-02-15 22:13:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:53,015 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:13:53,015 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 22:13:53,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:13:53,016 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 155 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:53,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 212 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:13:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 22:13:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-02-15 22:13:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.359375) 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) [2023-02-15 22:13:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2023-02-15 22:13:53,019 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 23 [2023-02-15 22:13:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:53,019 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2023-02-15 22:13:53,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-02-15 22:13:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2023-02-15 22:13:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:13:53,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:53,020 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] [2023-02-15 22:13:53,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:13:53,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1959765219, now seen corresponding path program 1 times [2023-02-15 22:13:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:53,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770165895] [2023-02-15 22:13:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770165895] [2023-02-15 22:13:53,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770165895] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:53,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:53,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:13:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908460764] [2023-02-15 22:13:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:53,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:13:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:13:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:13:53,164 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2023-02-15 22:13:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:53,386 INFO L93 Difference]: Finished difference Result 245 states and 262 transitions. [2023-02-15 22:13:53,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:13:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 23 [2023-02-15 22:13:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:53,387 INFO L225 Difference]: With dead ends: 245 [2023-02-15 22:13:53,388 INFO L226 Difference]: Without dead ends: 245 [2023-02-15 22:13:53,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:13:53,388 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 327 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:53,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 535 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-15 22:13:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 166. [2023-02-15 22:13:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 165 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) [2023-02-15 22:13:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2023-02-15 22:13:53,391 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 23 [2023-02-15 22:13:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:53,392 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2023-02-15 22:13:53,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2023-02-15 22:13:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2023-02-15 22:13:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:13:53,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:53,393 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] [2023-02-15 22:13:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:13:53,393 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1577640795, now seen corresponding path program 1 times [2023-02-15 22:13:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:53,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332238588] [2023-02-15 22:13:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332238588] [2023-02-15 22:13:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332238588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917081719] [2023-02-15 22:13:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:53,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:53,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:53,512 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) [2023-02-15 22:13:53,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:13:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:53,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 22:13:53,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:53,726 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:53,730 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:53,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:53,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917081719] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:53,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:53,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2023-02-15 22:13:53,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970474807] [2023-02-15 22:13:53,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:53,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:13:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:13:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:13:53,824 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2023-02-15 22:13:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:54,061 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2023-02-15 22:13:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:13:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 [2023-02-15 22:13:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:54,062 INFO L225 Difference]: With dead ends: 195 [2023-02-15 22:13:54,062 INFO L226 Difference]: Without dead ends: 195 [2023-02-15 22:13:54,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:13:54,063 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:54,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 762 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-15 22:13:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 176. [2023-02-15 22:13:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 175 states have internal predecessors, (190), 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) [2023-02-15 22:13:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2023-02-15 22:13:54,066 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 26 [2023-02-15 22:13:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:54,066 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2023-02-15 22:13:54,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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) [2023-02-15 22:13:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2023-02-15 22:13:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:13:54,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:54,067 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] [2023-02-15 22:13:54,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:13:54,272 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,SelfDestructingSolverStorable14 [2023-02-15 22:13:54,272 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1662225504, now seen corresponding path program 1 times [2023-02-15 22:13:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:54,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350010920] [2023-02-15 22:13:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:54,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350010920] [2023-02-15 22:13:54,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350010920] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:54,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839132721] [2023-02-15 22:13:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:54,346 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) [2023-02-15 22:13:54,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:13:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:13:54,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:54,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2023-02-15 22:13:54,524 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~item~0#1.base|))) (and (= (store |c_#valid| |ULTIMATE.start_main_~item~0#1.base| .cse0) |c_ULTIMATE.start_main_old_#valid#1|) (= 0 .cse0) (= (select |c_#valid| |ULTIMATE.start_main_~item~0#1.base|) 0)))) is different from true [2023-02-15 22:13:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 22:13:54,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:54,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839132721] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:54,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 22:13:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432224410] [2023-02-15 22:13:54,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:54,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:13:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:13:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-15 22:13:54,621 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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) [2023-02-15 22:13:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:54,721 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2023-02-15 22:13:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:13:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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 27 [2023-02-15 22:13:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:54,722 INFO L225 Difference]: With dead ends: 186 [2023-02-15 22:13:54,722 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 22:13:54,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2023-02-15 22:13:54,723 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 19 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:54,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 393 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 159 Unchecked, 0.1s Time] [2023-02-15 22:13:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 22:13:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-02-15 22:13:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 166 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) [2023-02-15 22:13:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2023-02-15 22:13:54,726 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 27 [2023-02-15 22:13:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:54,726 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2023-02-15 22:13:54,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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) [2023-02-15 22:13:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2023-02-15 22:13:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:13:54,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:54,728 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] [2023-02-15 22:13:54,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:13:54,932 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,SelfDestructingSolverStorable15 [2023-02-15 22:13:54,933 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -112828615, now seen corresponding path program 1 times [2023-02-15 22:13:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347125757] [2023-02-15 22:13:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347125757] [2023-02-15 22:13:55,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347125757] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495069895] [2023-02-15 22:13:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:55,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:55,161 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) [2023-02-15 22:13:55,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:13:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:55,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:13:55,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:55,249 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:55,298 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:55,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:13:55,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:55,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:13:55,384 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 28 [2023-02-15 22:13:55,448 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:13:55,448 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-15 22:13:55,470 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:13:55,471 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 28 [2023-02-15 22:13:55,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 22:13:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:55,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:55,626 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 22:13:55,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 22:13:55,640 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 22:13:55,646 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 22:13:55,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:55,657 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 30 [2023-02-15 22:13:55,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:55,671 INFO L350 Elim1Store]: Elim1 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 245 treesize of output 220 [2023-02-15 22:13:55,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:55,681 INFO L350 Elim1Store]: Elim1 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 197 [2023-02-15 22:13:55,685 INFO L350 Elim1Store]: Elim1 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 188 treesize of output 180 [2023-02-15 22:13:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:55,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495069895] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:55,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:55,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2023-02-15 22:13:55,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594079728] [2023-02-15 22:13:55,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:55,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:13:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:55,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:13:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=385, Unknown=9, NotChecked=172, Total=650 [2023-02-15 22:13:55,847 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 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) [2023-02-15 22:13:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:56,329 INFO L93 Difference]: Finished difference Result 275 states and 298 transitions. [2023-02-15 22:13:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:13:56,330 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 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 [2023-02-15 22:13:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:56,331 INFO L225 Difference]: With dead ends: 275 [2023-02-15 22:13:56,331 INFO L226 Difference]: Without dead ends: 275 [2023-02-15 22:13:56,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=738, Unknown=9, NotChecked=244, Total=1190 [2023-02-15 22:13:56,332 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 509 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 604 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:56,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 995 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 790 Invalid, 0 Unknown, 604 Unchecked, 0.3s Time] [2023-02-15 22:13:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-02-15 22:13:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 177. [2023-02-15 22:13:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 176 states have internal predecessors, (192), 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) [2023-02-15 22:13:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2023-02-15 22:13:56,334 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 33 [2023-02-15 22:13:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:56,334 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2023-02-15 22:13:56,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 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) [2023-02-15 22:13:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2023-02-15 22:13:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:13:56,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:56,335 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] [2023-02-15 22:13:56,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:13:56,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:56,536 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1345804944, now seen corresponding path program 1 times [2023-02-15 22:13:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:56,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009460156] [2023-02-15 22:13:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:56,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009460156] [2023-02-15 22:13:56,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009460156] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:56,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:56,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:13:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082699315] [2023-02-15 22:13:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:56,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:13:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:13:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:56,566 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:56,583 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2023-02-15 22:13:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:13:56,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-15 22:13:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:56,584 INFO L225 Difference]: With dead ends: 253 [2023-02-15 22:13:56,584 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 22:13:56,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:13:56,585 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:56,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 262 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:13:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 22:13:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 198. [2023-02-15 22:13:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.2969696969696969) internal successors, (214), 197 states have internal predecessors, (214), 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) [2023-02-15 22:13:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2023-02-15 22:13:56,588 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 34 [2023-02-15 22:13:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:56,589 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2023-02-15 22:13:56,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2023-02-15 22:13:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:13:56,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:56,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:56,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 22:13:56,590 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1953253304, now seen corresponding path program 1 times [2023-02-15 22:13:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:56,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575930961] [2023-02-15 22:13:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:56,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575930961] [2023-02-15 22:13:56,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575930961] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580235411] [2023-02-15 22:13:56,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:56,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:56,771 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) [2023-02-15 22:13:56,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:13:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:56,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:13:56,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:56,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:13:56,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:13:56,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:13:56,934 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:56,934 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:56,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:57,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580235411] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:57,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:57,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2023-02-15 22:13:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718779424] [2023-02-15 22:13:57,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:57,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:13:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:13:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:13:57,086 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 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) [2023-02-15 22:13:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:57,352 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2023-02-15 22:13:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:13:57,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 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 [2023-02-15 22:13:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:57,353 INFO L225 Difference]: With dead ends: 263 [2023-02-15 22:13:57,354 INFO L226 Difference]: Without dead ends: 263 [2023-02-15 22:13:57,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:13:57,354 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 644 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:57,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 320 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-02-15 22:13:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 196. [2023-02-15 22:13:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 195 states have internal predecessors, (211), 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) [2023-02-15 22:13:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2023-02-15 22:13:57,357 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 41 [2023-02-15 22:13:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:57,358 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2023-02-15 22:13:57,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 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) [2023-02-15 22:13:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2023-02-15 22:13:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:13:57,358 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:57,358 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] [2023-02-15 22:13:57,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 22:13:57,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:57,564 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:13:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443618, now seen corresponding path program 1 times [2023-02-15 22:13:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:57,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460703190] [2023-02-15 22:13:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:57,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460703190] [2023-02-15 22:13:57,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460703190] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:57,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740904833] [2023-02-15 22:13:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:57,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:57,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:57,868 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) [2023-02-15 22:13:57,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:13:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:58,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 22:13:58,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:58,011 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,072 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:13:58,073 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,102 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,194 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:13:58,194 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,290 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:13:58,291 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,312 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:13:58,312 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,421 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:13:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:58,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:00,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:00,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_794) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:00,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 (Array Int Int)) (v_ArrVal_794 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_794)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 22:14:00,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:00,683 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:00,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:00,690 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:00,696 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:00,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:00,706 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:05,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740904833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:05,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:05,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2023-02-15 22:14:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887260291] [2023-02-15 22:14:05,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:05,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:14:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:14:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=749, Unknown=20, NotChecked=180, Total=1122 [2023-02-15 22:14:05,523 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 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) [2023-02-15 22:14:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:06,463 INFO L93 Difference]: Finished difference Result 337 states and 364 transitions. [2023-02-15 22:14:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:14:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 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 43 [2023-02-15 22:14:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:06,465 INFO L225 Difference]: With dead ends: 337 [2023-02-15 22:14:06,465 INFO L226 Difference]: Without dead ends: 337 [2023-02-15 22:14:06,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=490, Invalid=1663, Unknown=21, NotChecked=276, Total=2450 [2023-02-15 22:14:06,466 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1305 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:06,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1069 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 970 Invalid, 0 Unknown, 595 Unchecked, 0.5s Time] [2023-02-15 22:14:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-02-15 22:14:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 207. [2023-02-15 22:14:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 206 states have internal predecessors, (226), 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) [2023-02-15 22:14:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2023-02-15 22:14:06,469 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 43 [2023-02-15 22:14:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:06,469 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2023-02-15 22:14:06,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 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) [2023-02-15 22:14:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2023-02-15 22:14:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:14:06,471 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:06,471 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] [2023-02-15 22:14:06,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:06,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:06,676 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 22:14:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443619, now seen corresponding path program 1 times [2023-02-15 22:14:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:06,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808466924] [2023-02-15 22:14:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808466924] [2023-02-15 22:14:07,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808466924] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185749343] [2023-02-15 22:14:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:07,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:07,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:07,077 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) [2023-02-15 22:14:07,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:14:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:07,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:14:07,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:07,171 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,224 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:14:07,225 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:14:07,261 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,266 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,340 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:07,354 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 37 [2023-02-15 22:14:07,360 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,490 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:07,490 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:07,497 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,546 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:14:07,547 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 37 [2023-02-15 22:14:07,551 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,686 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:14:07,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:14:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:07,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:07,883 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 22:14:07,898 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 22:14:07,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_898 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2023-02-15 22:14:07,920 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_894) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_894))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) .cse0 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-02-15 22:14:07,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_894))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_893) .cse1 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_893) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_894) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))))) is different from false [2023-02-15 22:14:07,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:07,950 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 74 [2023-02-15 22:14:07,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:07,955 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 50 [2023-02-15 22:14:07,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:07,964 INFO L350 Elim1Store]: Elim1 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 632 treesize of output 567 [2023-02-15 22:14:07,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:07,981 INFO L350 Elim1Store]: Elim1 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 1872 treesize of output 1783 [2023-02-15 22:14:07,998 INFO L350 Elim1Store]: Elim1 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 1768 treesize of output 1736 [2023-02-15 22:14:08,008 INFO L350 Elim1Store]: Elim1 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 1736 treesize of output 1656 [2023-02-15 22:14:08,018 INFO L350 Elim1Store]: Elim1 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 1656 treesize of output 1576 [2023-02-15 22:14:08,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:08,034 INFO L350 Elim1Store]: Elim1 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 1576 treesize of output 1436