./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:35:19,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:35:19,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:35:19,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:35:19,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:35:19,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:35:19,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:35:19,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:35:19,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:35:19,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:35:19,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:35:19,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:35:19,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:35:19,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:35:19,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:35:19,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:35:19,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:35:19,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:35:19,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:35:19,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:35:19,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:35:19,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:35:19,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:35:19,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:35:19,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:35:19,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:35:19,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:35:19,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:35:19,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:35:19,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:35:19,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:35:19,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:35:19,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:35:19,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:35:19,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:35:19,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:35:19,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:35:19,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:35:19,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:35:19,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:35:19,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:35:19,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:35:19,202 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:35:19,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:35:19,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:35:19,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:35:19,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:35:19,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:35:19,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:35:19,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:35:19,206 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:35:19,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:35:19,207 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:35:19,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:35:19,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:35:19,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:35:19,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:35:19,208 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:35:19,208 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:35:19,208 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:35:19,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:35:19,209 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:35:19,209 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:35:19,209 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:35:19,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:35:19,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:35:19,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:35:19,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:19,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:35:19,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:35:19,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:35:19,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:35:19,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:35:19,211 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:35:19,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:35:19,212 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:35:19,212 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2023-02-16 03:35:19,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:35:19,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:35:19,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:35:19,517 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:35:19,518 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:35:19,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2023-02-16 03:35:20,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:35:21,076 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:35:21,077 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2023-02-16 03:35:21,090 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04e6ba1d/6428eaef9ec2462ab6d30b9be87084e1/FLAG3648b60e2 [2023-02-16 03:35:21,101 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04e6ba1d/6428eaef9ec2462ab6d30b9be87084e1 [2023-02-16 03:35:21,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:35:21,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:35:21,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:21,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:35:21,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:35:21,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c73f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21, skipping insertion in model container [2023-02-16 03:35:21,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:35:21,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:35:21,397 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/sll-01-2.i[22034,22047] [2023-02-16 03:35:21,414 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/sll-01-2.i[22307,22320] [2023-02-16 03:35:21,416 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/sll-01-2.i[22516,22529] [2023-02-16 03:35:21,416 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/sll-01-2.i[22586,22599] [2023-02-16 03:35:21,418 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/sll-01-2.i[22853,22866] [2023-02-16 03:35:21,419 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/sll-01-2.i[22961,22974] [2023-02-16 03:35:21,421 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/sll-01-2.i[23192,23205] [2023-02-16 03:35:21,422 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/sll-01-2.i[23272,23285] [2023-02-16 03:35:21,423 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/sll-01-2.i[23351,23364] [2023-02-16 03:35:21,424 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/sll-01-2.i[23484,23497] [2023-02-16 03:35:21,428 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/sll-01-2.i[23662,23675] [2023-02-16 03:35:21,431 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/sll-01-2.i[23740,23753] [2023-02-16 03:35:21,431 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/sll-01-2.i[23817,23830] [2023-02-16 03:35:21,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:21,445 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:35:21,469 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/sll-01-2.i[22034,22047] [2023-02-16 03:35:21,471 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/sll-01-2.i[22307,22320] [2023-02-16 03:35:21,473 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/sll-01-2.i[22516,22529] [2023-02-16 03:35:21,473 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/sll-01-2.i[22586,22599] [2023-02-16 03:35:21,475 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/sll-01-2.i[22853,22866] [2023-02-16 03:35:21,476 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/sll-01-2.i[22961,22974] [2023-02-16 03:35:21,477 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/sll-01-2.i[23192,23205] [2023-02-16 03:35:21,478 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/sll-01-2.i[23272,23285] [2023-02-16 03:35:21,479 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/sll-01-2.i[23351,23364] [2023-02-16 03:35:21,479 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/sll-01-2.i[23484,23497] [2023-02-16 03:35:21,481 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/sll-01-2.i[23662,23675] [2023-02-16 03:35:21,481 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/sll-01-2.i[23740,23753] [2023-02-16 03:35:21,482 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/sll-01-2.i[23817,23830] [2023-02-16 03:35:21,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:21,505 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:35:21,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21 WrapperNode [2023-02-16 03:35:21,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:21,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:21,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:35:21,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:35:21,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,562 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2023-02-16 03:35:21,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:21,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:35:21,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:35:21,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:35:21,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,597 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:35:21,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:35:21,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:35:21,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:35:21,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (1/1) ... [2023-02-16 03:35:21,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:21,634 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-16 03:35:21,668 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-16 03:35:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:35:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:35:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:35:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:35:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:35:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:35:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:35:21,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:35:21,835 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:35:21,837 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:35:22,395 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:35:22,404 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:35:22,404 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-16 03:35:22,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:22 BoogieIcfgContainer [2023-02-16 03:35:22,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:35:22,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:35:22,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:35:22,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:35:22,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:35:21" (1/3) ... [2023-02-16 03:35:22,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16971f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:22, skipping insertion in model container [2023-02-16 03:35:22,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:21" (2/3) ... [2023-02-16 03:35:22,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16971f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:22, skipping insertion in model container [2023-02-16 03:35:22,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:22" (3/3) ... [2023-02-16 03:35:22,416 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2023-02-16 03:35:22,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:35:22,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2023-02-16 03:35:22,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:35:22,474 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;@d542661, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:35:22,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2023-02-16 03:35:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 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-16 03:35:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:22,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:22,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:22,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:35:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117617254] [2023-02-16 03:35:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:22,709 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-16 03:35:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:22,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117617254] [2023-02-16 03:35:22,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117617254] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:22,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:22,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473377404] [2023-02-16 03:35:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:22,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:22,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:22,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:22,757 INFO L87 Difference]: Start difference. First operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 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-16 03:35:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:22,962 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2023-02-16 03:35:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:22,965 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-16 03:35:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:22,972 INFO L225 Difference]: With dead ends: 197 [2023-02-16 03:35:22,974 INFO L226 Difference]: Without dead ends: 193 [2023-02-16 03:35:22,975 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-16 03:35:22,982 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 188 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:22,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 123 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-02-16 03:35:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2023-02-16 03:35:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 187 states have internal predecessors, (201), 0 states have call successors, (0), 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-16 03:35:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2023-02-16 03:35:23,053 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 3 [2023-02-16 03:35:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:23,055 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2023-02-16 03:35:23,055 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-16 03:35:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2023-02-16 03:35:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:23,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:23,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:23,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:35:23,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:23,059 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:35:23,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:23,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806313883] [2023-02-16 03:35:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:23,174 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-16 03:35:23,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:23,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806313883] [2023-02-16 03:35:23,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806313883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:23,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:23,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852078484] [2023-02-16 03:35:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:23,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:23,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:23,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:23,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:23,177 INFO L87 Difference]: Start difference. First operand 188 states and 201 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-16 03:35:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:23,328 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2023-02-16 03:35:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:23,335 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-16 03:35:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:23,339 INFO L225 Difference]: With dead ends: 218 [2023-02-16 03:35:23,339 INFO L226 Difference]: Without dead ends: 218 [2023-02-16 03:35:23,340 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-16 03:35:23,341 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 178 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:23,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 149 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-16 03:35:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2023-02-16 03:35:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.669172932330827) internal successors, (222), 197 states have internal predecessors, (222), 0 states have call successors, (0), 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-16 03:35:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2023-02-16 03:35:23,359 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 3 [2023-02-16 03:35:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:23,359 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2023-02-16 03:35:23,362 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-16 03:35:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2023-02-16 03:35:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:35:23,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:23,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:35:23,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:35:23,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2023-02-16 03:35:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:23,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836282915] [2023-02-16 03:35:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:23,449 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-16 03:35:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836282915] [2023-02-16 03:35:23,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836282915] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:23,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:23,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786844119] [2023-02-16 03:35:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:23,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:23,452 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:23,490 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2023-02-16 03:35:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:35:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:23,492 INFO L225 Difference]: With dead ends: 213 [2023-02-16 03:35:23,492 INFO L226 Difference]: Without dead ends: 213 [2023-02-16 03:35:23,492 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-16 03:35:23,495 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 175 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:23,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-16 03:35:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2023-02-16 03:35:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.6590909090909092) internal successors, (219), 195 states have internal predecessors, (219), 0 states have call successors, (0), 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-16 03:35:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 219 transitions. [2023-02-16 03:35:23,515 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 219 transitions. Word has length 5 [2023-02-16 03:35:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:23,516 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 219 transitions. [2023-02-16 03:35:23,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2023-02-16 03:35:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:35:23,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:23,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:23,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:35:23,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2023-02-16 03:35:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:23,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059168952] [2023-02-16 03:35:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:23,656 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-16 03:35:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059168952] [2023-02-16 03:35:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059168952] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:23,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:23,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254982867] [2023-02-16 03:35:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:23,659 INFO L87 Difference]: Start difference. First operand 196 states and 219 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-16 03:35:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:23,833 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2023-02-16 03:35:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-02-16 03:35:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:23,834 INFO L225 Difference]: With dead ends: 195 [2023-02-16 03:35:23,835 INFO L226 Difference]: Without dead ends: 195 [2023-02-16 03:35:23,835 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-16 03:35:23,838 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 5 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:23,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 536 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-16 03:35:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2023-02-16 03:35:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2023-02-16 03:35:23,860 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 11 [2023-02-16 03:35:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:23,860 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2023-02-16 03:35:23,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-16 03:35:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2023-02-16 03:35:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:35:23,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:23,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:23,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:35:23,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2023-02-16 03:35:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:23,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429374098] [2023-02-16 03:35:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:24,062 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-16 03:35:24,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:24,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429374098] [2023-02-16 03:35:24,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429374098] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:24,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:24,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573081818] [2023-02-16 03:35:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:24,065 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-16 03:35:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:24,224 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2023-02-16 03:35:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-02-16 03:35:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:24,225 INFO L225 Difference]: With dead ends: 194 [2023-02-16 03:35:24,225 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 03:35:24,225 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-16 03:35:24,226 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:24,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 547 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 03:35:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2023-02-16 03:35:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.643939393939394) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 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-16 03:35:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2023-02-16 03:35:24,230 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 11 [2023-02-16 03:35:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:24,230 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2023-02-16 03:35:24,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-16 03:35:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2023-02-16 03:35:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:35:24,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:24,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:24,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:35:24,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2023-02-16 03:35:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:24,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327131593] [2023-02-16 03:35:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:24,254 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-16 03:35:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:24,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327131593] [2023-02-16 03:35:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327131593] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:24,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:24,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174857941] [2023-02-16 03:35:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:24,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:24,256 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:24,265 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2023-02-16 03:35:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 03:35:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:24,266 INFO L225 Difference]: With dead ends: 195 [2023-02-16 03:35:24,266 INFO L226 Difference]: Without dead ends: 195 [2023-02-16 03:35:24,266 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-16 03:35:24,267 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:24,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-16 03:35:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2023-02-16 03:35:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2023-02-16 03:35:24,271 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 13 [2023-02-16 03:35:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:24,272 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2023-02-16 03:35:24,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2023-02-16 03:35:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:35:24,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:24,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:24,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:35:24,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2023-02-16 03:35:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:24,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063976571] [2023-02-16 03:35:24,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:24,486 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-16 03:35:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:24,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063976571] [2023-02-16 03:35:24,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063976571] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:24,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:24,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487103111] [2023-02-16 03:35:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:24,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:24,488 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-16 03:35:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:24,712 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2023-02-16 03:35:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:24,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-16 03:35:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:24,714 INFO L225 Difference]: With dead ends: 195 [2023-02-16 03:35:24,714 INFO L226 Difference]: Without dead ends: 195 [2023-02-16 03:35:24,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:35:24,717 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 175 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:24,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 457 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-16 03:35:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2023-02-16 03:35:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.631578947368421) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 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-16 03:35:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2023-02-16 03:35:24,722 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 14 [2023-02-16 03:35:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:24,723 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2023-02-16 03:35:24,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-16 03:35:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2023-02-16 03:35:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:35:24,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:24,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:35:24,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2023-02-16 03:35:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:24,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435917396] [2023-02-16 03:35:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:24,998 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-16 03:35:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:24,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435917396] [2023-02-16 03:35:24,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435917396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:24,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:24,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351709942] [2023-02-16 03:35:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:24,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:25,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:25,000 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-16 03:35:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:25,318 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2023-02-16 03:35:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:25,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-16 03:35:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:25,319 INFO L225 Difference]: With dead ends: 194 [2023-02-16 03:35:25,319 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 03:35:25,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:35:25,320 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 171 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:25,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 495 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 03:35:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2023-02-16 03:35:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 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-16 03:35:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2023-02-16 03:35:25,324 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 14 [2023-02-16 03:35:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:25,324 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2023-02-16 03:35:25,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-16 03:35:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2023-02-16 03:35:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:35:25,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:25,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:25,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:35:25,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2023-02-16 03:35:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:25,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874372033] [2023-02-16 03:35:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:25,465 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-16 03:35:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:25,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874372033] [2023-02-16 03:35:25,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874372033] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:25,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:25,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406982143] [2023-02-16 03:35:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:25,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:35:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:35:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:35:25,468 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:25,656 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2023-02-16 03:35:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:25,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-16 03:35:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:25,658 INFO L225 Difference]: With dead ends: 285 [2023-02-16 03:35:25,658 INFO L226 Difference]: Without dead ends: 285 [2023-02-16 03:35:25,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:35:25,659 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 203 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:25,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 724 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-16 03:35:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 190. [2023-02-16 03:35:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.6259541984732824) internal successors, (213), 189 states have internal predecessors, (213), 0 states have call successors, (0), 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-16 03:35:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2023-02-16 03:35:25,664 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 15 [2023-02-16 03:35:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:25,664 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2023-02-16 03:35:25,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2023-02-16 03:35:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:35:25,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:25,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:25,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:35:25,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2023-02-16 03:35:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:25,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338144328] [2023-02-16 03:35:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:25,747 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-16 03:35:25,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:25,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338144328] [2023-02-16 03:35:25,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338144328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:25,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67757077] [2023-02-16 03:35:25,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:25,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:25,749 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-16 03:35:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:25,857 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2023-02-16 03:35:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:35:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-02-16 03:35:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:25,860 INFO L225 Difference]: With dead ends: 286 [2023-02-16 03:35:25,860 INFO L226 Difference]: Without dead ends: 286 [2023-02-16 03:35:25,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:35:25,861 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:25,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 602 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-02-16 03:35:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 193. [2023-02-16 03:35:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 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-16 03:35:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2023-02-16 03:35:25,866 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 17 [2023-02-16 03:35:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:25,867 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2023-02-16 03:35:25,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-16 03:35:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2023-02-16 03:35:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:35:25,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:25,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:25,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:35:25,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2023-02-16 03:35:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:25,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959803271] [2023-02-16 03:35:25,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,005 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-16 03:35:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959803271] [2023-02-16 03:35:26,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959803271] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:26,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:26,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719348468] [2023-02-16 03:35:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:26,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:26,007 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:26,187 INFO L93 Difference]: Finished difference Result 262 states and 279 transitions. [2023-02-16 03:35:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:26,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:35:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:26,189 INFO L225 Difference]: With dead ends: 262 [2023-02-16 03:35:26,189 INFO L226 Difference]: Without dead ends: 262 [2023-02-16 03:35:26,189 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-16 03:35:26,189 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 265 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:26,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 215 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-16 03:35:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 219. [2023-02-16 03:35:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.64375) internal successors, (263), 218 states have internal predecessors, (263), 0 states have call successors, (0), 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-16 03:35:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 263 transitions. [2023-02-16 03:35:26,194 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 263 transitions. Word has length 19 [2023-02-16 03:35:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:26,194 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 263 transitions. [2023-02-16 03:35:26,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 263 transitions. [2023-02-16 03:35:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:35:26,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:26,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:26,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:35:26,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -582241036, now seen corresponding path program 1 times [2023-02-16 03:35:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:26,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458874900] [2023-02-16 03:35:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,285 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-16 03:35:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:26,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458874900] [2023-02-16 03:35:26,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458874900] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:26,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:26,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812888506] [2023-02-16 03:35:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:26,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:26,287 INFO L87 Difference]: Start difference. First operand 219 states and 263 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:26,411 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2023-02-16 03:35:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-16 03:35:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:26,413 INFO L225 Difference]: With dead ends: 212 [2023-02-16 03:35:26,413 INFO L226 Difference]: Without dead ends: 212 [2023-02-16 03:35:26,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:26,414 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 256 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:26,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 118 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-16 03:35:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2023-02-16 03:35:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.5375) internal successors, (246), 207 states have internal predecessors, (246), 0 states have call successors, (0), 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-16 03:35:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 246 transitions. [2023-02-16 03:35:26,418 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 246 transitions. Word has length 19 [2023-02-16 03:35:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:26,419 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 246 transitions. [2023-02-16 03:35:26,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 246 transitions. [2023-02-16 03:35:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:35:26,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:26,420 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-16 03:35:26,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:35:26,420 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2023-02-16 03:35:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:26,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666135768] [2023-02-16 03:35:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,451 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-16 03:35:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:26,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666135768] [2023-02-16 03:35:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666135768] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:26,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654293630] [2023-02-16 03:35:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:26,454 INFO L87 Difference]: Start difference. First operand 208 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-16 03:35:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:26,549 INFO L93 Difference]: Finished difference Result 240 states and 256 transitions. [2023-02-16 03:35:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-16 03:35:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:26,551 INFO L225 Difference]: With dead ends: 240 [2023-02-16 03:35:26,551 INFO L226 Difference]: Without dead ends: 240 [2023-02-16 03:35:26,552 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-16 03:35:26,553 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 236 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:26,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 276 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-02-16 03:35:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2023-02-16 03:35:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 159 states have (on average 1.528301886792453) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 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-16 03:35:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2023-02-16 03:35:26,559 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 21 [2023-02-16 03:35:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:26,560 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2023-02-16 03:35:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-16 03:35:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2023-02-16 03:35:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:35:26,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:26,561 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-16 03:35:26,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 03:35:26,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2023-02-16 03:35:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:26,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061508983] [2023-02-16 03:35:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,652 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-16 03:35:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:26,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061508983] [2023-02-16 03:35:26,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061508983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:26,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:26,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224248466] [2023-02-16 03:35:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:26,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:26,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:26,655 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-16 03:35:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:26,857 INFO L93 Difference]: Finished difference Result 206 states and 243 transitions. [2023-02-16 03:35:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-16 03:35:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:26,858 INFO L225 Difference]: With dead ends: 206 [2023-02-16 03:35:26,859 INFO L226 Difference]: Without dead ends: 206 [2023-02-16 03:35:26,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:26,859 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:26,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 443 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-16 03:35:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2023-02-16 03:35:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.5220125786163523) internal successors, (242), 204 states have internal predecessors, (242), 0 states have call successors, (0), 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-16 03:35:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2023-02-16 03:35:26,864 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 23 [2023-02-16 03:35:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:26,864 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2023-02-16 03:35:26,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-16 03:35:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2023-02-16 03:35:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:35:26,864 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:26,864 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-16 03:35:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 03:35:26,865 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2023-02-16 03:35:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:26,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927944054] [2023-02-16 03:35:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:26,995 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-16 03:35:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:26,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927944054] [2023-02-16 03:35:26,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927944054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:26,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:26,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328842170] [2023-02-16 03:35:26,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:26,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:26,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:26,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:26,997 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-16 03:35:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:27,234 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2023-02-16 03:35:27,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:27,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-16 03:35:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:27,235 INFO L225 Difference]: With dead ends: 198 [2023-02-16 03:35:27,235 INFO L226 Difference]: Without dead ends: 198 [2023-02-16 03:35:27,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:27,236 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 41 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:27,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 510 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-16 03:35:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2023-02-16 03:35:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.474025974025974) internal successors, (227), 190 states have internal predecessors, (227), 0 states have call successors, (0), 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-16 03:35:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2023-02-16 03:35:27,240 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 23 [2023-02-16 03:35:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:27,240 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2023-02-16 03:35:27,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-16 03:35:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2023-02-16 03:35:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:35:27,241 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:27,241 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] [2023-02-16 03:35:27,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:35:27,241 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2023-02-16 03:35:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:27,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082391095] [2023-02-16 03:35:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:27,330 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-16 03:35:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082391095] [2023-02-16 03:35:27,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082391095] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:27,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:27,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:35:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852981236] [2023-02-16 03:35:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:27,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:27,334 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:27,450 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2023-02-16 03:35:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-16 03:35:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:27,451 INFO L225 Difference]: With dead ends: 194 [2023-02-16 03:35:27,451 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 03:35:27,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:27,452 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 38 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:27,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 621 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 03:35:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2023-02-16 03:35:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 186 states have internal predecessors, (223), 0 states have call successors, (0), 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-16 03:35:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2023-02-16 03:35:27,457 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 25 [2023-02-16 03:35:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:27,457 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2023-02-16 03:35:27,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2023-02-16 03:35:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:35:27,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:27,460 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-16 03:35:27,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:35:27,461 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 476921774, now seen corresponding path program 1 times [2023-02-16 03:35:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:27,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454370031] [2023-02-16 03:35:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:27,495 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-16 03:35:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:27,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454370031] [2023-02-16 03:35:27,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454370031] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:27,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:27,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:27,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536483714] [2023-02-16 03:35:27,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:27,499 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:27,508 INFO L93 Difference]: Finished difference Result 260 states and 311 transitions. [2023-02-16 03:35:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 03:35:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:27,510 INFO L225 Difference]: With dead ends: 260 [2023-02-16 03:35:27,510 INFO L226 Difference]: Without dead ends: 260 [2023-02-16 03:35:27,511 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-16 03:35:27,511 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:27,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-16 03:35:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2023-02-16 03:35:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 192 states have internal predecessors, (231), 0 states have call successors, (0), 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-16 03:35:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2023-02-16 03:35:27,516 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 27 [2023-02-16 03:35:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:27,516 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2023-02-16 03:35:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2023-02-16 03:35:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:35:27,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:27,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:27,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:35:27,519 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2023-02-16 03:35:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591283830] [2023-02-16 03:35:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:27,549 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-16 03:35:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:27,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591283830] [2023-02-16 03:35:27,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591283830] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:27,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:27,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615265143] [2023-02-16 03:35:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:27,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:27,551 INFO L87 Difference]: Start difference. First operand 193 states and 231 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:27,569 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2023-02-16 03:35:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-16 03:35:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:27,570 INFO L225 Difference]: With dead ends: 191 [2023-02-16 03:35:27,570 INFO L226 Difference]: Without dead ends: 191 [2023-02-16 03:35:27,570 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-16 03:35:27,571 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:27,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-16 03:35:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2023-02-16 03:35:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 190 states have internal predecessors, (228), 0 states have call successors, (0), 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-16 03:35:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2023-02-16 03:35:27,574 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 28 [2023-02-16 03:35:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:27,575 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2023-02-16 03:35:27,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2023-02-16 03:35:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:35:27,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:27,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 03:35:27,575 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2023-02-16 03:35:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:27,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825288658] [2023-02-16 03:35:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:27,749 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-16 03:35:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:27,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825288658] [2023-02-16 03:35:27,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825288658] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:27,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:27,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:35:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103817806] [2023-02-16 03:35:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:27,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:35:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:35:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:27,752 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:28,096 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2023-02-16 03:35:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:35:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 03:35:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:28,098 INFO L225 Difference]: With dead ends: 321 [2023-02-16 03:35:28,098 INFO L226 Difference]: Without dead ends: 321 [2023-02-16 03:35:28,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:35:28,099 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 503 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:28,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 736 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:28,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-16 03:35:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 224. [2023-02-16 03:35:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 190 states have (on average 1.4) internal successors, (266), 223 states have internal predecessors, (266), 0 states have call successors, (0), 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-16 03:35:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2023-02-16 03:35:28,105 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 29 [2023-02-16 03:35:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:28,105 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2023-02-16 03:35:28,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2023-02-16 03:35:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:35:28,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:28,106 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] [2023-02-16 03:35:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-16 03:35:28,106 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1491142186, now seen corresponding path program 1 times [2023-02-16 03:35:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:28,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347542663] [2023-02-16 03:35:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:28,272 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-16 03:35:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:28,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347542663] [2023-02-16 03:35:28,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347542663] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:28,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361594876] [2023-02-16 03:35:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:28,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:28,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:28,281 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-16 03:35:28,300 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-16 03:35:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:28,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 03:35:28,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:28,454 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-16 03:35:28,458 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-16 03:35:28,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:28,503 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 21 treesize of output 20 [2023-02-16 03:35:28,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:28,526 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 21 treesize of output 20 [2023-02-16 03:35:28,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:28,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:35:28,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:28,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:28,653 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 15 treesize of output 10 [2023-02-16 03:35:28,662 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-16 03:35:28,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:29,121 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 10 treesize of output 8 [2023-02-16 03:35:29,127 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 14 treesize of output 12 [2023-02-16 03:35:29,139 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 10 treesize of output 8 [2023-02-16 03:35:29,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:35:29,157 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-16 03:35:29,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361594876] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:29,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:29,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-16 03:35:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205051551] [2023-02-16 03:35:29,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:29,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:35:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:35:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:29,159 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 03:35:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:29,474 INFO L93 Difference]: Finished difference Result 323 states and 362 transitions. [2023-02-16 03:35:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 03:35:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:29,476 INFO L225 Difference]: With dead ends: 323 [2023-02-16 03:35:29,476 INFO L226 Difference]: Without dead ends: 323 [2023-02-16 03:35:29,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:35:29,477 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 668 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:29,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 648 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-02-16 03:35:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 262. [2023-02-16 03:35:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 261 states have internal predecessors, (320), 0 states have call successors, (0), 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-16 03:35:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 320 transitions. [2023-02-16 03:35:29,482 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 320 transitions. Word has length 31 [2023-02-16 03:35:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:29,482 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 320 transitions. [2023-02-16 03:35:29,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 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-16 03:35:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2023-02-16 03:35:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:35:29,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:29,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:29,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 03:35:29,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:29,689 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:29,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2023-02-16 03:35:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:29,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249594174] [2023-02-16 03:35:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:29,780 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-16 03:35:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:29,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249594174] [2023-02-16 03:35:29,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249594174] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:29,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:29,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687530945] [2023-02-16 03:35:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:29,784 INFO L87 Difference]: Start difference. First operand 262 states and 320 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-16 03:35:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:29,906 INFO L93 Difference]: Finished difference Result 261 states and 319 transitions. [2023-02-16 03:35:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-16 03:35:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:29,907 INFO L225 Difference]: With dead ends: 261 [2023-02-16 03:35:29,907 INFO L226 Difference]: Without dead ends: 261 [2023-02-16 03:35:29,908 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-16 03:35:29,908 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 5 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 426 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-16 03:35:29,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 426 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-02-16 03:35:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2023-02-16 03:35:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 228 states have (on average 1.3991228070175439) internal successors, (319), 260 states have internal predecessors, (319), 0 states have call successors, (0), 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-16 03:35:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 319 transitions. [2023-02-16 03:35:29,913 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 319 transitions. Word has length 33 [2023-02-16 03:35:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:29,914 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 319 transitions. [2023-02-16 03:35:29,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-16 03:35:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 319 transitions. [2023-02-16 03:35:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:35:29,914 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:29,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:29,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 03:35:29,915 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2023-02-16 03:35:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:29,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319962672] [2023-02-16 03:35:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:30,093 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-16 03:35:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:30,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319962672] [2023-02-16 03:35:30,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319962672] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:30,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:30,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699146265] [2023-02-16 03:35:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:30,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:30,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:30,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:30,094 INFO L87 Difference]: Start difference. First operand 261 states and 319 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-16 03:35:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:30,230 INFO L93 Difference]: Finished difference Result 260 states and 318 transitions. [2023-02-16 03:35:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:30,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-16 03:35:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:30,232 INFO L225 Difference]: With dead ends: 260 [2023-02-16 03:35:30,232 INFO L226 Difference]: Without dead ends: 260 [2023-02-16 03:35:30,232 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-16 03:35:30,232 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:30,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 429 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-16 03:35:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2023-02-16 03:35:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.394736842105263) internal successors, (318), 259 states have internal predecessors, (318), 0 states have call successors, (0), 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-16 03:35:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2023-02-16 03:35:30,237 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 33 [2023-02-16 03:35:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:30,237 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2023-02-16 03:35:30,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-16 03:35:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2023-02-16 03:35:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:35:30,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:30,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:30,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:35:30,238 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2023-02-16 03:35:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:30,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459280330] [2023-02-16 03:35:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:30,505 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-16 03:35:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459280330] [2023-02-16 03:35:30,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459280330] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:30,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:30,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:35:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045414542] [2023-02-16 03:35:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:30,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:35:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:35:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:35:30,507 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-16 03:35:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:31,049 INFO L93 Difference]: Finished difference Result 370 states and 417 transitions. [2023-02-16 03:35:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:35:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-16 03:35:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:31,051 INFO L225 Difference]: With dead ends: 370 [2023-02-16 03:35:31,051 INFO L226 Difference]: Without dead ends: 370 [2023-02-16 03:35:31,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:35:31,051 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 406 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:31,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 930 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:35:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-16 03:35:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 261. [2023-02-16 03:35:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 231 states have (on average 1.367965367965368) internal successors, (316), 260 states have internal predecessors, (316), 0 states have call successors, (0), 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-16 03:35:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 316 transitions. [2023-02-16 03:35:31,057 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 316 transitions. Word has length 34 [2023-02-16 03:35:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:31,057 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 316 transitions. [2023-02-16 03:35:31,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 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-16 03:35:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 316 transitions. [2023-02-16 03:35:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:35:31,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:31,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:31,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-16 03:35:31,058 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2023-02-16 03:35:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:31,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439022328] [2023-02-16 03:35:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:31,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:31,545 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-16 03:35:31,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:31,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439022328] [2023-02-16 03:35:31,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439022328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:31,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:31,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:35:31,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325563555] [2023-02-16 03:35:31,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:31,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:35:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:31,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:35:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:31,548 INFO L87 Difference]: Start difference. First operand 261 states and 316 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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-16 03:35:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:32,234 INFO L93 Difference]: Finished difference Result 439 states and 480 transitions. [2023-02-16 03:35:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:35:32,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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-16 03:35:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:32,236 INFO L225 Difference]: With dead ends: 439 [2023-02-16 03:35:32,236 INFO L226 Difference]: Without dead ends: 439 [2023-02-16 03:35:32,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:35:32,237 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 597 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:32,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 988 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:35:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-16 03:35:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 267. [2023-02-16 03:35:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 266 states have internal predecessors, (323), 0 states have call successors, (0), 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-16 03:35:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 323 transitions. [2023-02-16 03:35:32,243 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 323 transitions. Word has length 34 [2023-02-16 03:35:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:32,243 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 323 transitions. [2023-02-16 03:35:32,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 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-16 03:35:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 323 transitions. [2023-02-16 03:35:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:35:32,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:32,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:32,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-16 03:35:32,244 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2023-02-16 03:35:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:32,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312343230] [2023-02-16 03:35:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:32,289 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-16 03:35:32,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:32,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312343230] [2023-02-16 03:35:32,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312343230] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:32,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:32,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:32,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602814398] [2023-02-16 03:35:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:32,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:32,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:32,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:32,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:32,292 INFO L87 Difference]: Start difference. First operand 267 states and 323 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:32,299 INFO L93 Difference]: Finished difference Result 269 states and 325 transitions. [2023-02-16 03:35:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-16 03:35:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:32,301 INFO L225 Difference]: With dead ends: 269 [2023-02-16 03:35:32,301 INFO L226 Difference]: Without dead ends: 269 [2023-02-16 03:35:32,302 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-16 03:35:32,302 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:32,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-16 03:35:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-02-16 03:35:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.3598326359832635) internal successors, (325), 268 states have internal predecessors, (325), 0 states have call successors, (0), 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-16 03:35:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 325 transitions. [2023-02-16 03:35:32,313 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 325 transitions. Word has length 35 [2023-02-16 03:35:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:32,313 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 325 transitions. [2023-02-16 03:35:32,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 325 transitions. [2023-02-16 03:35:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:35:32,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:32,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:32,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-16 03:35:32,315 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2023-02-16 03:35:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:32,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181177483] [2023-02-16 03:35:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:32,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:32,919 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-16 03:35:32,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181177483] [2023-02-16 03:35:32,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181177483] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:32,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:32,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-16 03:35:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901447636] [2023-02-16 03:35:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:32,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:35:32,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:35:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:35:32,921 INFO L87 Difference]: Start difference. First operand 269 states and 325 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:33,691 INFO L93 Difference]: Finished difference Result 433 states and 474 transitions. [2023-02-16 03:35:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:35:33,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-16 03:35:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:33,693 INFO L225 Difference]: With dead ends: 433 [2023-02-16 03:35:33,693 INFO L226 Difference]: Without dead ends: 433 [2023-02-16 03:35:33,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2023-02-16 03:35:33,694 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 721 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:33,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1161 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:35:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-02-16 03:35:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 269. [2023-02-16 03:35:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 268 states have internal predecessors, (324), 0 states have call successors, (0), 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-16 03:35:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 324 transitions. [2023-02-16 03:35:33,699 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 324 transitions. Word has length 36 [2023-02-16 03:35:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:33,699 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 324 transitions. [2023-02-16 03:35:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 324 transitions. [2023-02-16 03:35:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:35:33,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:33,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:33,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-16 03:35:33,700 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -339896365, now seen corresponding path program 1 times [2023-02-16 03:35:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:33,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769649349] [2023-02-16 03:35:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:33,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769649349] [2023-02-16 03:35:33,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769649349] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:33,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:33,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427665037] [2023-02-16 03:35:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:33,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:35:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:35:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:35:33,809 INFO L87 Difference]: Start difference. First operand 269 states and 324 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:33,995 INFO L93 Difference]: Finished difference Result 284 states and 339 transitions. [2023-02-16 03:35:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:33,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-16 03:35:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:33,996 INFO L225 Difference]: With dead ends: 284 [2023-02-16 03:35:33,996 INFO L226 Difference]: Without dead ends: 284 [2023-02-16 03:35:33,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:35:33,997 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 29 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:33,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 641 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-16 03:35:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2023-02-16 03:35:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 248 states have (on average 1.342741935483871) internal successors, (333), 277 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 03:35:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 333 transitions. [2023-02-16 03:35:34,002 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 333 transitions. Word has length 36 [2023-02-16 03:35:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:34,002 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 333 transitions. [2023-02-16 03:35:34,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 333 transitions. [2023-02-16 03:35:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:35:34,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:34,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-16 03:35:34,003 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2023-02-16 03:35:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:34,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175334768] [2023-02-16 03:35:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:34,265 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-16 03:35:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:34,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175334768] [2023-02-16 03:35:34,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175334768] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:34,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:34,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:35:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816039558] [2023-02-16 03:35:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:34,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:35:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:35:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:35:34,268 INFO L87 Difference]: Start difference. First operand 278 states and 333 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:34,626 INFO L93 Difference]: Finished difference Result 278 states and 333 transitions. [2023-02-16 03:35:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:35:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-16 03:35:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:34,627 INFO L225 Difference]: With dead ends: 278 [2023-02-16 03:35:34,627 INFO L226 Difference]: Without dead ends: 278 [2023-02-16 03:35:34,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:35:34,628 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:34,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 831 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:35:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-02-16 03:35:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2023-02-16 03:35:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 248 states have (on average 1.3387096774193548) internal successors, (332), 276 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 03:35:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2023-02-16 03:35:34,633 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 332 transitions. Word has length 36 [2023-02-16 03:35:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:34,633 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 332 transitions. [2023-02-16 03:35:34,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 332 transitions. [2023-02-16 03:35:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:35:34,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:34,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-16 03:35:34,635 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:34,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2023-02-16 03:35:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:34,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604356717] [2023-02-16 03:35:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:35,001 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-16 03:35:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604356717] [2023-02-16 03:35:35,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604356717] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:35,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:35,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:35:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966071402] [2023-02-16 03:35:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:35,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:35:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:35,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:35:35,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:35:35,004 INFO L87 Difference]: Start difference. First operand 277 states and 332 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:35,406 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2023-02-16 03:35:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:35:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-02-16 03:35:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:35,408 INFO L225 Difference]: With dead ends: 277 [2023-02-16 03:35:35,408 INFO L226 Difference]: Without dead ends: 277 [2023-02-16 03:35:35,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:35:35,409 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 80 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 817 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:35:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-02-16 03:35:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2023-02-16 03:35:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 275 states have internal predecessors, (331), 0 states have call successors, (0), 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-16 03:35:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 331 transitions. [2023-02-16 03:35:35,414 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 331 transitions. Word has length 36 [2023-02-16 03:35:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:35,414 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 331 transitions. [2023-02-16 03:35:35,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 03:35:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 331 transitions. [2023-02-16 03:35:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:35:35,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:35,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:35,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-16 03:35:35,415 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2023-02-16 03:35:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:35,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334515418] [2023-02-16 03:35:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:35,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-16 03:35:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:35,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334515418] [2023-02-16 03:35:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334515418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:35,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:35,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:35,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810096456] [2023-02-16 03:35:35,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:35,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:35:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:35:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:35:35,536 INFO L87 Difference]: Start difference. First operand 276 states and 331 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 03:35:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:35,706 INFO L93 Difference]: Finished difference Result 286 states and 342 transitions. [2023-02-16 03:35:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:35,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 03:35:35,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:35,708 INFO L225 Difference]: With dead ends: 286 [2023-02-16 03:35:35,708 INFO L226 Difference]: Without dead ends: 286 [2023-02-16 03:35:35,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:35:35,709 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 31 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:35,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 457 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-02-16 03:35:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 272. [2023-02-16 03:35:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 271 states have internal predecessors, (326), 0 states have call successors, (0), 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-16 03:35:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2023-02-16 03:35:35,713 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 37 [2023-02-16 03:35:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:35,714 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2023-02-16 03:35:35,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-16 03:35:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2023-02-16 03:35:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:35:35,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:35,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:35,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-16 03:35:35,715 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -160017480, now seen corresponding path program 1 times [2023-02-16 03:35:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123716822] [2023-02-16 03:35:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:35,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123716822] [2023-02-16 03:35:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123716822] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:35,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:35,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292107141] [2023-02-16 03:35:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:35,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:35,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:35,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:35,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:35,755 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:35:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:35,789 INFO L93 Difference]: Finished difference Result 285 states and 330 transitions. [2023-02-16 03:35:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-02-16 03:35:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:35,791 INFO L225 Difference]: With dead ends: 285 [2023-02-16 03:35:35,791 INFO L226 Difference]: Without dead ends: 285 [2023-02-16 03:35:35,791 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-16 03:35:35,792 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:35,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 150 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-16 03:35:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2023-02-16 03:35:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 0 states have call successors, (0), 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-16 03:35:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 327 transitions. [2023-02-16 03:35:35,797 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 327 transitions. Word has length 38 [2023-02-16 03:35:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:35,798 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 327 transitions. [2023-02-16 03:35:35,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 03:35:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 327 transitions. [2023-02-16 03:35:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:35:35,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:35,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:35,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-16 03:35:35,799 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2023-02-16 03:35:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:35,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801791214] [2023-02-16 03:35:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:36,434 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-16 03:35:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:36,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801791214] [2023-02-16 03:35:36,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801791214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:36,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:36,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-16 03:35:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991548583] [2023-02-16 03:35:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:36,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:35:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:36,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:35:36,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:35:36,435 INFO L87 Difference]: Start difference. First operand 273 states and 327 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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-16 03:35:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:37,244 INFO L93 Difference]: Finished difference Result 435 states and 475 transitions. [2023-02-16 03:35:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:35:37,245 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-16 03:35:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:37,246 INFO L225 Difference]: With dead ends: 435 [2023-02-16 03:35:37,246 INFO L226 Difference]: Without dead ends: 435 [2023-02-16 03:35:37,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2023-02-16 03:35:37,247 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 491 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:37,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1276 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 03:35:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-02-16 03:35:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 273. [2023-02-16 03:35:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 272 states have internal predecessors, (326), 0 states have call successors, (0), 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-16 03:35:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 326 transitions. [2023-02-16 03:35:37,254 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 326 transitions. Word has length 39 [2023-02-16 03:35:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:37,254 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 326 transitions. [2023-02-16 03:35:37,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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-16 03:35:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 326 transitions. [2023-02-16 03:35:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:35:37,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:37,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:37,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-16 03:35:37,256 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash -862296903, now seen corresponding path program 1 times [2023-02-16 03:35:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:37,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427115449] [2023-02-16 03:35:37,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:37,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:37,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427115449] [2023-02-16 03:35:37,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427115449] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:37,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:37,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27981476] [2023-02-16 03:35:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:37,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:37,295 INFO L87 Difference]: Start difference. First operand 273 states and 326 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:37,338 INFO L93 Difference]: Finished difference Result 275 states and 327 transitions. [2023-02-16 03:35:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-16 03:35:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:37,340 INFO L225 Difference]: With dead ends: 275 [2023-02-16 03:35:37,340 INFO L226 Difference]: Without dead ends: 275 [2023-02-16 03:35:37,340 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-16 03:35:37,341 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:37,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-02-16 03:35:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2023-02-16 03:35:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 270 states have internal predecessors, (323), 0 states have call successors, (0), 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-16 03:35:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 323 transitions. [2023-02-16 03:35:37,347 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 323 transitions. Word has length 41 [2023-02-16 03:35:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:37,347 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 323 transitions. [2023-02-16 03:35:37,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 323 transitions. [2023-02-16 03:35:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:35:37,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:37,348 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] [2023-02-16 03:35:37,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-16 03:35:37,348 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:37,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash 333412926, now seen corresponding path program 1 times [2023-02-16 03:35:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:37,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994862304] [2023-02-16 03:35:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:37,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:37,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994862304] [2023-02-16 03:35:37,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994862304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:37,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048956973] [2023-02-16 03:35:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:37,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:37,521 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-16 03:35:37,549 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-16 03:35:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:37,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 03:35:37,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:37,651 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-16 03:35:37,656 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-16 03:35:37,683 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:35:37,688 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 21 treesize of output 20 [2023-02-16 03:35:37,762 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-16 03:35:37,766 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-16 03:35:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:37,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:37,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048956973] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:37,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:37,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2023-02-16 03:35:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85160450] [2023-02-16 03:35:37,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:37,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:35:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:35:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:37,882 INFO L87 Difference]: Start difference. First operand 271 states and 323 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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-16 03:35:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:38,260 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2023-02-16 03:35:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:35:38,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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-16 03:35:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:38,262 INFO L225 Difference]: With dead ends: 372 [2023-02-16 03:35:38,262 INFO L226 Difference]: Without dead ends: 372 [2023-02-16 03:35:38,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:35:38,263 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 202 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:38,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 872 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:35:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-02-16 03:35:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 295. [2023-02-16 03:35:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 269 states have (on average 1.3271375464684014) internal successors, (357), 294 states have internal predecessors, (357), 0 states have call successors, (0), 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-16 03:35:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 357 transitions. [2023-02-16 03:35:38,269 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 357 transitions. Word has length 41 [2023-02-16 03:35:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:38,269 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 357 transitions. [2023-02-16 03:35:38,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 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-16 03:35:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 357 transitions. [2023-02-16 03:35:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:35:38,269 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:38,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:38,281 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-16 03:35:38,474 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,SelfDestructingSolverStorable33 [2023-02-16 03:35:38,475 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -961395774, now seen corresponding path program 1 times [2023-02-16 03:35:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:38,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994394294] [2023-02-16 03:35:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:38,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994394294] [2023-02-16 03:35:38,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994394294] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:38,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:38,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:35:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015614008] [2023-02-16 03:35:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:38,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:35:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:38,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:35:38,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:38,666 INFO L87 Difference]: Start difference. First operand 295 states and 357 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-16 03:35:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:39,011 INFO L93 Difference]: Finished difference Result 361 states and 415 transitions. [2023-02-16 03:35:39,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:39,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-02-16 03:35:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:39,012 INFO L225 Difference]: With dead ends: 361 [2023-02-16 03:35:39,013 INFO L226 Difference]: Without dead ends: 361 [2023-02-16 03:35:39,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:35:39,013 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 442 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:39,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 522 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:35:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-16 03:35:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 302. [2023-02-16 03:35:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.326086956521739) internal successors, (366), 301 states have internal predecessors, (366), 0 states have call successors, (0), 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-16 03:35:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 366 transitions. [2023-02-16 03:35:39,018 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 366 transitions. Word has length 42 [2023-02-16 03:35:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:39,018 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 366 transitions. [2023-02-16 03:35:39,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-16 03:35:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 366 transitions. [2023-02-16 03:35:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:35:39,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:39,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-16 03:35:39,019 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -961395773, now seen corresponding path program 1 times [2023-02-16 03:35:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136017601] [2023-02-16 03:35:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136017601] [2023-02-16 03:35:39,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136017601] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:39,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:39,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:35:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230109278] [2023-02-16 03:35:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:39,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:35:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:35:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:39,307 INFO L87 Difference]: Start difference. First operand 302 states and 366 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-16 03:35:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:39,687 INFO L93 Difference]: Finished difference Result 361 states and 415 transitions. [2023-02-16 03:35:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-02-16 03:35:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:39,689 INFO L225 Difference]: With dead ends: 361 [2023-02-16 03:35:39,689 INFO L226 Difference]: Without dead ends: 361 [2023-02-16 03:35:39,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:35:39,690 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 326 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:39,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 581 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:35:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-16 03:35:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 308. [2023-02-16 03:35:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 282 states have (on average 1.322695035460993) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 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-16 03:35:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2023-02-16 03:35:39,694 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 42 [2023-02-16 03:35:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:39,694 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2023-02-16 03:35:39,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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-16 03:35:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2023-02-16 03:35:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:35:39,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:39,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-02-16 03:35:39,695 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1745867301, now seen corresponding path program 1 times [2023-02-16 03:35:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:39,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368507712] [2023-02-16 03:35:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:39,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368507712] [2023-02-16 03:35:39,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368507712] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:39,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511895964] [2023-02-16 03:35:39,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:39,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:39,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:39,789 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-16 03:35:39,793 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-16 03:35:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:39,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:35:39,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:40,011 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-16 03:35:40,021 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~list~0#1.base_43| Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~list~0#1.base_43|))) (and (= (store |c_#valid| |v_ULTIMATE.start_main_~list~0#1.base_43| .cse0) |c_ULTIMATE.start_main_old_#valid#1|) (= (select |c_#valid| |v_ULTIMATE.start_main_~list~0#1.base_43|) 0) (= 0 .cse0)))) is different from true [2023-02-16 03:35:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-02-16 03:35:40,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:35:40,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511895964] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:40,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:40,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-02-16 03:35:40,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624351447] [2023-02-16 03:35:40,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:40,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:40,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:40,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-16 03:35:40,179 INFO L87 Difference]: Start difference. First operand 308 states and 373 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-16 03:35:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:40,280 INFO L93 Difference]: Finished difference Result 339 states and 404 transitions. [2023-02-16 03:35:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:40,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 42 [2023-02-16 03:35:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:40,281 INFO L225 Difference]: With dead ends: 339 [2023-02-16 03:35:40,281 INFO L226 Difference]: Without dead ends: 315 [2023-02-16 03:35:40,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-16 03:35:40,282 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:40,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 141 Unchecked, 0.1s Time] [2023-02-16 03:35:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-02-16 03:35:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2023-02-16 03:35:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 289 states have (on average 1.314878892733564) internal successors, (380), 314 states have internal predecessors, (380), 0 states have call successors, (0), 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-16 03:35:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 380 transitions. [2023-02-16 03:35:40,287 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 380 transitions. Word has length 42 [2023-02-16 03:35:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:40,287 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 380 transitions. [2023-02-16 03:35:40,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-16 03:35:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 380 transitions. [2023-02-16 03:35:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:35:40,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:40,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:40,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:35:40,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:40,494 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2023-02-16 03:35:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash -377971448, now seen corresponding path program 1 times [2023-02-16 03:35:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:40,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892907597] [2023-02-16 03:35:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:35:40,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 03:35:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 03:35:40,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 03:35:40,548 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 03:35:40,549 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 80 remaining) [2023-02-16 03:35:40,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2023-02-16 03:35:40,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2023-02-16 03:35:40,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (76 of 80 remaining) [2023-02-16 03:35:40,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2023-02-16 03:35:40,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2023-02-16 03:35:40,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2023-02-16 03:35:40,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2023-02-16 03:35:40,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2023-02-16 03:35:40,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2023-02-16 03:35:40,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2023-02-16 03:35:40,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2023-02-16 03:35:40,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2023-02-16 03:35:40,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2023-02-16 03:35:40,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (59 of 80 remaining) [2023-02-16 03:35:40,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2023-02-16 03:35:40,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2023-02-16 03:35:40,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2023-02-16 03:35:40,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (52 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (51 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2023-02-16 03:35:40,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2023-02-16 03:35:40,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2023-02-16 03:35:40,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2023-02-16 03:35:40,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2023-02-16 03:35:40,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2023-02-16 03:35:40,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2023-02-16 03:35:40,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2023-02-16 03:35:40,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2023-02-16 03:35:40,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2023-02-16 03:35:40,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (33 of 80 remaining) [2023-02-16 03:35:40,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2023-02-16 03:35:40,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2023-02-16 03:35:40,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (30 of 80 remaining) [2023-02-16 03:35:40,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (27 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2023-02-16 03:35:40,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (20 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2023-02-16 03:35:40,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (15 of 80 remaining) [2023-02-16 03:35:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2023-02-16 03:35:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2023-02-16 03:35:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK (12 of 80 remaining) [2023-02-16 03:35:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2023-02-16 03:35:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2023-02-16 03:35:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE (8 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE (7 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (6 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2023-02-16 03:35:40,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2023-02-16 03:35:40,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2023-02-16 03:35:40,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2023-02-16 03:35:40,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-02-16 03:35:40,566 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:40,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 03:35:40,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 03:35:40 BoogieIcfgContainer [2023-02-16 03:35:40,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 03:35:40,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 03:35:40,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 03:35:40,595 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 03:35:40,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:22" (3/4) ... [2023-02-16 03:35:40,597 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 03:35:40,629 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 03:35:40,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 03:35:40,630 INFO L158 Benchmark]: Toolchain (without parser) took 19525.30ms. Allocated memory was 134.2MB in the beginning and 283.1MB in the end (delta: 148.9MB). Free memory was 104.6MB in the beginning and 217.7MB in the end (delta: -113.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,630 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:35:40,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.93ms. Allocated memory is still 134.2MB. Free memory was 104.1MB in the beginning and 84.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.34ms. Allocated memory is still 134.2MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,631 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 134.2MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,631 INFO L158 Benchmark]: RCFGBuilder took 803.75ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 97.2MB in the end (delta: -17.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,631 INFO L158 Benchmark]: TraceAbstraction took 18185.89ms. Allocated memory was 134.2MB in the beginning and 283.1MB in the end (delta: 148.9MB). Free memory was 96.6MB in the beginning and 220.8MB in the end (delta: -124.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,631 INFO L158 Benchmark]: Witness Printer took 34.38ms. Allocated memory is still 283.1MB. Free memory was 220.8MB in the beginning and 217.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 03:35:40,632 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.93ms. Allocated memory is still 134.2MB. Free memory was 104.1MB in the beginning and 84.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.34ms. Allocated memory is still 134.2MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 134.2MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 803.75ms. Allocated memory is still 134.2MB. Free memory was 80.0MB in the beginning and 97.2MB in the end (delta: -17.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18185.89ms. Allocated memory was 134.2MB in the beginning and 283.1MB in the end (delta: 148.9MB). Free memory was 96.6MB in the beginning and 220.8MB in the end (delta: -124.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 34.38ms. Allocated memory is still 283.1MB. Free memory was 220.8MB in the beginning and 217.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 195 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6986 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6986 mSDsluCounter, 19151 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 141 IncrementalHoareTripleChecker+Unchecked, 14152 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9695 IncrementalHoareTripleChecker+Invalid, 10118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 4999 mSDtfsCounter, 9695 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 274 SyntacticMatches, 6 SemanticMatches, 336 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=37, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 1387 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1143 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1171 ConstructedInterpolants, 19 QuantifiedInterpolants, 11645 SizeOfPredicates, 20 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 43 InterpolantComputations, 34 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-16 03:35:40,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)