./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:50:12,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:50:12,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:50:12,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:50:12,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:50:12,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:50:12,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:50:12,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:50:12,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:50:12,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:50:12,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:50:12,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:50:12,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:50:12,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:50:12,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:50:12,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:50:12,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:50:12,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:50:12,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:50:12,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:50:12,253 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:50:12,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:50:12,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:50:12,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:50:12,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:50:12,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:50:12,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:50:12,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:50:12,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:50:12,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:50:12,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:50:12,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:50:12,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:50:12,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:50:12,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:50:12,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:50:12,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:50:12,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:50:12,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:50:12,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:50:12,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:50:12,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:50:12,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-14 05:50:12,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:50:12,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:50:12,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:50:12,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:50:12,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:50:12,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:50:12,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:50:12,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:50:12,308 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:50:12,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:50:12,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:50:12,310 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:50:12,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:50:12,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:50:12,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:50:12,310 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:50:12,310 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:50:12,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:50:12,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:50:12,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:50:12,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:50:12,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:50:12,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:50:12,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:50:12,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:12,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:50:12,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:50:12,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:50:12,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:50:12,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2022-07-14 05:50:12,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:50:12,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:50:12,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:50:12,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:50:12,571 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:50:12,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2022-07-14 05:50:12,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699621545/e9135f766da34bd1b612d5cfd08b9b95/FLAG437ea62f6 [2022-07-14 05:50:13,103 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:50:13,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2022-07-14 05:50:13,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699621545/e9135f766da34bd1b612d5cfd08b9b95/FLAG437ea62f6 [2022-07-14 05:50:13,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699621545/e9135f766da34bd1b612d5cfd08b9b95 [2022-07-14 05:50:13,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:50:13,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:50:13,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:13,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:50:13,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:50:13,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f3ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13, skipping insertion in model container [2022-07-14 05:50:13,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:50:13,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:50:13,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-07-14 05:50:13,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-07-14 05:50:13,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-07-14 05:50:13,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-07-14 05:50:13,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-07-14 05:50:13,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-07-14 05:50:13,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-07-14 05:50:13,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-07-14 05:50:13,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-07-14 05:50:13,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-07-14 05:50:13,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-07-14 05:50:13,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-07-14 05:50:13,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-07-14 05:50:13,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:13,799 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:50:13,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2022-07-14 05:50:13,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2022-07-14 05:50:13,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2022-07-14 05:50:13,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2022-07-14 05:50:13,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2022-07-14 05:50:13,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2022-07-14 05:50:13,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2022-07-14 05:50:13,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2022-07-14 05:50:13,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2022-07-14 05:50:13,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2022-07-14 05:50:13,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2022-07-14 05:50:13,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2022-07-14 05:50:13,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2022-07-14 05:50:13,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:50:13,898 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:50:13,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13 WrapperNode [2022-07-14 05:50:13,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:50:13,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:13,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:50:13,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:50:13,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,942 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2022-07-14 05:50:13,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:50:13,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:50:13,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:50:13,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:50:13,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:50:13,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:50:13,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:50:13,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:50:13,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (1/1) ... [2022-07-14 05:50:13,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:50:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:14,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 05:50:14,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 05:50:14,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 05:50:14,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 05:50:14,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 05:50:14,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 05:50:14,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:50:14,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 05:50:14,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:50:14,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:50:14,177 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:50:14,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:50:14,702 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:50:14,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:50:14,708 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-14 05:50:14,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:14 BoogieIcfgContainer [2022-07-14 05:50:14,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:50:14,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:50:14,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:50:14,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:50:14,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:50:13" (1/3) ... [2022-07-14 05:50:14,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf70dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:14, skipping insertion in model container [2022-07-14 05:50:14,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:50:13" (2/3) ... [2022-07-14 05:50:14,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf70dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:50:14, skipping insertion in model container [2022-07-14 05:50:14,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:14" (3/3) ... [2022-07-14 05:50:14,720 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2022-07-14 05:50:14,733 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:50:14,733 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2022-07-14 05:50:14,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:50:14,776 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4253c00b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e139226 [2022-07-14 05:50:14,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2022-07-14 05:50:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:14,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:14,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:14,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:14,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 05:50:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:14,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212483341] [2022-07-14 05:50:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:14,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:14,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212483341] [2022-07-14 05:50:14,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212483341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:14,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:14,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519574773] [2022-07-14 05:50:14,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:14,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:14,990 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,207 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2022-07-14 05:50:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 05:50:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,220 INFO L225 Difference]: With dead ends: 201 [2022-07-14 05:50:15,221 INFO L226 Difference]: Without dead ends: 197 [2022-07-14 05:50:15,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,228 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 122 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-14 05:50:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2022-07-14 05:50:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2022-07-14 05:50:15,294 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 3 [2022-07-14 05:50:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,294 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2022-07-14 05:50:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2022-07-14 05:50:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 05:50:15,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 05:50:15,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:50:15,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 05:50:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287898489] [2022-07-14 05:50:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287898489] [2022-07-14 05:50:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287898489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166613808] [2022-07-14 05:50:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:15,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,369 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,494 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2022-07-14 05:50:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 05:50:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,501 INFO L225 Difference]: With dead ends: 221 [2022-07-14 05:50:15,501 INFO L226 Difference]: Without dead ends: 221 [2022-07-14 05:50:15,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,509 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 180 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 148 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-14 05:50:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2022-07-14 05:50:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2022-07-14 05:50:15,525 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 3 [2022-07-14 05:50:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,526 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2022-07-14 05:50:15,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2022-07-14 05:50:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:50:15,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:50:15,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2022-07-14 05:50:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396001788] [2022-07-14 05:50:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396001788] [2022-07-14 05:50:15,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396001788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958866168] [2022-07-14 05:50:15,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:15,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:15,569 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,610 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2022-07-14 05:50:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 05:50:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,612 INFO L225 Difference]: With dead ends: 216 [2022-07-14 05:50:15,612 INFO L226 Difference]: Without dead ends: 216 [2022-07-14 05:50:15,613 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 [2022-07-14 05:50:15,615 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 176 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-14 05:50:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2022-07-14 05:50:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2022-07-14 05:50:15,639 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 6 [2022-07-14 05:50:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,639 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2022-07-14 05:50:15,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2022-07-14 05:50:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 05:50:15,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:50:15,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2022-07-14 05:50:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717090641] [2022-07-14 05:50:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:15,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717090641] [2022-07-14 05:50:15,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717090641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:15,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:15,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111737027] [2022-07-14 05:50:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:15,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:15,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:15,708 INFO L87 Difference]: Start difference. First operand 199 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:15,899 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-07-14 05:50:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:15,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 05:50:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:15,901 INFO L225 Difference]: With dead ends: 198 [2022-07-14 05:50:15,901 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 05:50:15,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:15,906 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 535 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 05:50:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-14 05:50:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2022-07-14 05:50:15,919 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 12 [2022-07-14 05:50:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:15,920 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2022-07-14 05:50:15,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-07-14 05:50:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 05:50:15,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:15,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:15,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:50:15,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:15,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2022-07-14 05:50:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:15,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769868190] [2022-07-14 05:50:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769868190] [2022-07-14 05:50:16,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769868190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583015819] [2022-07-14 05:50:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:16,051 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,211 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2022-07-14 05:50:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:16,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 05:50:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,214 INFO L225 Difference]: With dead ends: 197 [2022-07-14 05:50:16,215 INFO L226 Difference]: Without dead ends: 197 [2022-07-14 05:50:16,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:16,215 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 546 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-14 05:50:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-07-14 05:50:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 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) [2022-07-14 05:50:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2022-07-14 05:50:16,220 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 12 [2022-07-14 05:50:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,220 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2022-07-14 05:50:16,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2022-07-14 05:50:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:50:16,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:50:16,221 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2022-07-14 05:50:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286084351] [2022-07-14 05:50:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286084351] [2022-07-14 05:50:16,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286084351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438543147] [2022-07-14 05:50:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:16,288 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2022-07-14 05:50:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,296 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2022-07-14 05:50:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 [2022-07-14 05:50:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,297 INFO L225 Difference]: With dead ends: 198 [2022-07-14 05:50:16,297 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 05:50:16,298 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 [2022-07-14 05:50:16,299 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 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 [2022-07-14 05:50:16,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 05:50:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-14 05:50:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2022-07-14 05:50:16,303 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 14 [2022-07-14 05:50:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,304 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2022-07-14 05:50:16,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2022-07-14 05:50:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2022-07-14 05:50:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:50:16,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:50:16,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2022-07-14 05:50:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138806778] [2022-07-14 05:50:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138806778] [2022-07-14 05:50:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138806778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:16,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045177774] [2022-07-14 05:50:16,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:16,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:16,410 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:16,705 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2022-07-14 05:50:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 05:50:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:16,706 INFO L225 Difference]: With dead ends: 198 [2022-07-14 05:50:16,706 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 05:50:16,707 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 [2022-07-14 05:50:16,707 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:16,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 669 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 05:50:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-07-14 05:50:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 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) [2022-07-14 05:50:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2022-07-14 05:50:16,711 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 15 [2022-07-14 05:50:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2022-07-14 05:50:16,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2022-07-14 05:50:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:50:16,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:16,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:16,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:50:16,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2022-07-14 05:50:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:16,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724692542] [2022-07-14 05:50:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:16,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724692542] [2022-07-14 05:50:16,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724692542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:16,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:16,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805037346] [2022-07-14 05:50:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:50:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:50:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:16,825 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,116 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-07-14 05:50:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 05:50:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,118 INFO L225 Difference]: With dead ends: 197 [2022-07-14 05:50:17,118 INFO L226 Difference]: Without dead ends: 197 [2022-07-14 05:50:17,119 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 [2022-07-14 05:50:17,119 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 397 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-14 05:50:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2022-07-14 05:50:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2022-07-14 05:50:17,126 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 15 [2022-07-14 05:50:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,126 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2022-07-14 05:50:17,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2022-07-14 05:50:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 05:50:17,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:50:17,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2022-07-14 05:50:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005385935] [2022-07-14 05:50:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005385935] [2022-07-14 05:50:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005385935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:17,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602950233] [2022-07-14 05:50:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:17,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:17,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:17,242 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,439 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2022-07-14 05:50:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:17,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 05:50:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,441 INFO L225 Difference]: With dead ends: 283 [2022-07-14 05:50:17,441 INFO L226 Difference]: Without dead ends: 283 [2022-07-14 05:50:17,442 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 [2022-07-14 05:50:17,444 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 195 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 649 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-14 05:50:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 193. [2022-07-14 05:50:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2022-07-14 05:50:17,450 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 16 [2022-07-14 05:50:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,450 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2022-07-14 05:50:17,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2022-07-14 05:50:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:50:17,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:50:17,452 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2022-07-14 05:50:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844314328] [2022-07-14 05:50:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844314328] [2022-07-14 05:50:17,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844314328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135174095] [2022-07-14 05:50:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:17,519 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,614 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2022-07-14 05:50:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:17,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 05:50:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,616 INFO L225 Difference]: With dead ends: 284 [2022-07-14 05:50:17,616 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 05:50:17,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:17,616 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 100 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 611 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 05:50:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 196. [2022-07-14 05:50:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2022-07-14 05:50:17,622 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 18 [2022-07-14 05:50:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,622 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2022-07-14 05:50:17,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2022-07-14 05:50:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 05:50:17,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:50:17,624 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2022-07-14 05:50:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109256829] [2022-07-14 05:50:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109256829] [2022-07-14 05:50:17,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109256829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810939624] [2022-07-14 05:50:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:17,673 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:17,784 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-14 05:50:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:50:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 05:50:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:17,786 INFO L225 Difference]: With dead ends: 191 [2022-07-14 05:50:17,786 INFO L226 Difference]: Without dead ends: 191 [2022-07-14 05:50:17,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:17,787 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 257 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:17,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 115 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-14 05:50:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2022-07-14 05:50:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-14 05:50:17,792 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 20 [2022-07-14 05:50:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:17,793 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-14 05:50:17,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-14 05:50:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 05:50:17,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:17,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:17,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:50:17,796 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2022-07-14 05:50:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:17,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487141219] [2022-07-14 05:50:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:17,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487141219] [2022-07-14 05:50:17,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487141219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:17,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:17,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:17,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291066300] [2022-07-14 05:50:17,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:17,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:17,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:17,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:17,894 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,101 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2022-07-14 05:50:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:50:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 05:50:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,102 INFO L225 Difference]: With dead ends: 247 [2022-07-14 05:50:18,102 INFO L226 Difference]: Without dead ends: 247 [2022-07-14 05:50:18,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:18,103 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 449 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 254 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-14 05:50:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2022-07-14 05:50:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 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) [2022-07-14 05:50:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2022-07-14 05:50:18,107 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 20 [2022-07-14 05:50:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,107 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2022-07-14 05:50:18,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2022-07-14 05:50:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:50:18,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,108 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] [2022-07-14 05:50:18,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 05:50:18,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2022-07-14 05:50:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115679352] [2022-07-14 05:50:18,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115679352] [2022-07-14 05:50:18,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115679352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:18,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067885758] [2022-07-14 05:50:18,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:50:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:50:18,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:50:18,140 INFO L87 Difference]: Start difference. First operand 210 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,229 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2022-07-14 05:50:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:50:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-14 05:50:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,230 INFO L225 Difference]: With dead ends: 242 [2022-07-14 05:50:18,230 INFO L226 Difference]: Without dead ends: 242 [2022-07-14 05:50:18,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:18,231 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 233 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 271 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-14 05:50:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2022-07-14 05:50:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 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) [2022-07-14 05:50:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2022-07-14 05:50:18,238 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 22 [2022-07-14 05:50:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,238 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2022-07-14 05:50:18,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2022-07-14 05:50:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 05:50:18,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,239 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] [2022-07-14 05:50:18,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:50:18,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2022-07-14 05:50:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785760301] [2022-07-14 05:50:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785760301] [2022-07-14 05:50:18,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785760301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272454828] [2022-07-14 05:50:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:18,289 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,404 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2022-07-14 05:50:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 05:50:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,406 INFO L225 Difference]: With dead ends: 207 [2022-07-14 05:50:18,406 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 05:50:18,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:18,407 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 464 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:18,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 05:50:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-14 05:50:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2022-07-14 05:50:18,411 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 23 [2022-07-14 05:50:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,411 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2022-07-14 05:50:18,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2022-07-14 05:50:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 05:50:18,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,412 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] [2022-07-14 05:50:18,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 05:50:18,413 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2022-07-14 05:50:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792081143] [2022-07-14 05:50:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792081143] [2022-07-14 05:50:18,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792081143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725481565] [2022-07-14 05:50:18,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:18,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:18,468 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:18,611 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2022-07-14 05:50:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 05:50:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:18,612 INFO L225 Difference]: With dead ends: 206 [2022-07-14 05:50:18,612 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 05:50:18,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:18,615 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:18,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 05:50:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-14 05:50:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2022-07-14 05:50:18,619 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 23 [2022-07-14 05:50:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:18,619 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2022-07-14 05:50:18,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2022-07-14 05:50:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:18,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:18,622 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] [2022-07-14 05:50:18,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:50:18,622 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2022-07-14 05:50:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:18,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166412315] [2022-07-14 05:50:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:18,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166412315] [2022-07-14 05:50:18,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166412315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:18,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:18,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:50:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167157244] [2022-07-14 05:50:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:18,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:18,713 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,000 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2022-07-14 05:50:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:19,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 05:50:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,002 INFO L225 Difference]: With dead ends: 206 [2022-07-14 05:50:19,002 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 05:50:19,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-14 05:50:19,002 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 250 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 427 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 05:50:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-07-14 05:50:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2022-07-14 05:50:19,006 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 27 [2022-07-14 05:50:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,006 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2022-07-14 05:50:19,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2022-07-14 05:50:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:50:19,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,008 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] [2022-07-14 05:50:19,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 05:50:19,008 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2022-07-14 05:50:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034042871] [2022-07-14 05:50:19,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034042871] [2022-07-14 05:50:19,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034042871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 05:50:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916269245] [2022-07-14 05:50:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 05:50:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:19,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 05:50:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:50:19,147 INFO L87 Difference]: Start difference. First operand 205 states and 238 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2022-07-14 05:50:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,640 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-07-14 05:50:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 05:50:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 [2022-07-14 05:50:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,641 INFO L225 Difference]: With dead ends: 198 [2022-07-14 05:50:19,641 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 05:50:19,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-14 05:50:19,642 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 263 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 556 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 05:50:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 05:50:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2022-07-14 05:50:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 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) [2022-07-14 05:50:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2022-07-14 05:50:19,645 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 27 [2022-07-14 05:50:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,646 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2022-07-14 05:50:19,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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) [2022-07-14 05:50:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2022-07-14 05:50:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 05:50:19,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:19,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 05:50:19,647 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:19,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2022-07-14 05:50:19,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592871194] [2022-07-14 05:50:19,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592871194] [2022-07-14 05:50:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592871194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041734985] [2022-07-14 05:50:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:19,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:19,671 INFO L87 Difference]: Start difference. First operand 187 states and 219 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) [2022-07-14 05:50:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,679 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2022-07-14 05:50:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:19,679 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 [2022-07-14 05:50:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,681 INFO L225 Difference]: With dead ends: 260 [2022-07-14 05:50:19,681 INFO L226 Difference]: Without dead ends: 260 [2022-07-14 05:50:19,681 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 [2022-07-14 05:50:19,682 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 50 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-14 05:50:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2022-07-14 05:50:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 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) [2022-07-14 05:50:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 227 transitions. [2022-07-14 05:50:19,686 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 227 transitions. Word has length 28 [2022-07-14 05:50:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,687 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 227 transitions. [2022-07-14 05:50:19,687 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) [2022-07-14 05:50:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 227 transitions. [2022-07-14 05:50:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 05:50:19,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:19,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 05:50:19,688 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2022-07-14 05:50:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995518880] [2022-07-14 05:50:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:19,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995518880] [2022-07-14 05:50:19,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995518880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:50:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847784406] [2022-07-14 05:50:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:50:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:19,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:50:19,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:50:19,757 INFO L87 Difference]: Start difference. First operand 193 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,874 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2022-07-14 05:50:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:50:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 05:50:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,875 INFO L225 Difference]: With dead ends: 193 [2022-07-14 05:50:19,875 INFO L226 Difference]: Without dead ends: 193 [2022-07-14 05:50:19,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:50:19,876 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 347 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 226 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-14 05:50:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2022-07-14 05:50:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 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) [2022-07-14 05:50:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2022-07-14 05:50:19,880 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 29 [2022-07-14 05:50:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,881 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2022-07-14 05:50:19,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2022-07-14 05:50:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 05:50:19,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:19,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 05:50:19,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2022-07-14 05:50:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541431198] [2022-07-14 05:50:19,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:19,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541431198] [2022-07-14 05:50:19,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541431198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:19,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:19,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333859967] [2022-07-14 05:50:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:19,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:19,922 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:19,934 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-07-14 05:50:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 05:50:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:19,936 INFO L225 Difference]: With dead ends: 187 [2022-07-14 05:50:19,936 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 05:50:19,936 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 [2022-07-14 05:50:19,937 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:19,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 05:50:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 05:50:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2022-07-14 05:50:19,945 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 29 [2022-07-14 05:50:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:19,945 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2022-07-14 05:50:19,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2022-07-14 05:50:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 05:50:19,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:19,946 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] [2022-07-14 05:50:19,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 05:50:19,946 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:19,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2022-07-14 05:50:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:19,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293872848] [2022-07-14 05:50:19,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:20,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293872848] [2022-07-14 05:50:20,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293872848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:20,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:20,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 05:50:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306351699] [2022-07-14 05:50:20,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:20,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:50:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:20,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:50:20,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:50:20,080 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:20,385 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2022-07-14 05:50:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 05:50:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 05:50:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:20,387 INFO L225 Difference]: With dead ends: 290 [2022-07-14 05:50:20,387 INFO L226 Difference]: Without dead ends: 290 [2022-07-14 05:50:20,387 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 [2022-07-14 05:50:20,388 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 377 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:20,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 804 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 05:50:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-14 05:50:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 199. [2022-07-14 05:50:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2022-07-14 05:50:20,392 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 30 [2022-07-14 05:50:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:20,392 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2022-07-14 05:50:20,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2022-07-14 05:50:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 05:50:20,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:20,393 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:20,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 05:50:20,393 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2022-07-14 05:50:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:20,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499834377] [2022-07-14 05:50:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499834377] [2022-07-14 05:50:20,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499834377] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:50:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454010804] [2022-07-14 05:50:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:50:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:50:20,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 05:50:20,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 05:50:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:20,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 05:50:20,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:50:20,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:20,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 05:50:20,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:20,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 05:50:20,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:20,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 05:50:20,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:20,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 05:50:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:20,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 05:50:20,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:20,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 05:50:20,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:20,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:50:20,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-07-14 05:50:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:20,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:50:27,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-14 05:50:27,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:27,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:27,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-14 05:50:27,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-14 05:50:27,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:50:27,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:27,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:50:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:27,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454010804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:50:27,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:50:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-14 05:50:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715705064] [2022-07-14 05:50:27,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:50:27,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 05:50:27,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 05:50:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2022-07-14 05:50:27,469 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:27,756 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2022-07-14 05:50:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:50:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 05:50:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:27,758 INFO L225 Difference]: With dead ends: 286 [2022-07-14 05:50:27,758 INFO L226 Difference]: Without dead ends: 286 [2022-07-14 05:50:27,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=86, Invalid=251, Unknown=5, NotChecked=0, Total=342 [2022-07-14 05:50:27,759 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 509 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:27,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 850 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 305 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2022-07-14 05:50:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-14 05:50:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 227. [2022-07-14 05:50:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2022-07-14 05:50:27,763 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 32 [2022-07-14 05:50:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:27,763 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2022-07-14 05:50:27,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2022-07-14 05:50:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:50:27,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:27,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:27,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 05:50:27,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 05:50:27,965 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2022-07-14 05:50:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:27,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228092024] [2022-07-14 05:50:27,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:28,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:28,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228092024] [2022-07-14 05:50:28,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228092024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:28,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:28,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 05:50:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295822989] [2022-07-14 05:50:28,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:28,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 05:50:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 05:50:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 05:50:28,124 INFO L87 Difference]: Start difference. First operand 227 states and 274 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:28,630 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2022-07-14 05:50:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 05:50:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 05:50:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:28,632 INFO L225 Difference]: With dead ends: 334 [2022-07-14 05:50:28,632 INFO L226 Difference]: Without dead ends: 334 [2022-07-14 05:50:28,632 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 [2022-07-14 05:50:28,633 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 387 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:28,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 919 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 05:50:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-14 05:50:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2022-07-14 05:50:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 272 transitions. [2022-07-14 05:50:28,637 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 272 transitions. Word has length 35 [2022-07-14 05:50:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:28,637 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 272 transitions. [2022-07-14 05:50:28,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 272 transitions. [2022-07-14 05:50:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:50:28,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:28,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 05:50:28,638 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2022-07-14 05:50:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845411401] [2022-07-14 05:50:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:28,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845411401] [2022-07-14 05:50:28,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845411401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:28,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:28,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 05:50:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590859823] [2022-07-14 05:50:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:28,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 05:50:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:28,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 05:50:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:50:28,856 INFO L87 Difference]: Start difference. First operand 228 states and 272 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:29,512 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2022-07-14 05:50:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:50:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 05:50:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:29,514 INFO L225 Difference]: With dead ends: 400 [2022-07-14 05:50:29,514 INFO L226 Difference]: Without dead ends: 400 [2022-07-14 05:50:29,515 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 [2022-07-14 05:50:29,515 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 575 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:29,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 964 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:50:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-14 05:50:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 234. [2022-07-14 05:50:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2022-07-14 05:50:29,521 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 35 [2022-07-14 05:50:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:29,521 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2022-07-14 05:50:29,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2022-07-14 05:50:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:50:29,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:29,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:29,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 05:50:29,523 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2022-07-14 05:50:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365883570] [2022-07-14 05:50:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365883570] [2022-07-14 05:50:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365883570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:29,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 05:50:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080383018] [2022-07-14 05:50:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 05:50:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 05:50:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-14 05:50:29,806 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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) [2022-07-14 05:50:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:30,816 INFO L93 Difference]: Finished difference Result 331 states and 362 transitions. [2022-07-14 05:50:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 05:50:30,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 [2022-07-14 05:50:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:30,819 INFO L225 Difference]: With dead ends: 331 [2022-07-14 05:50:30,819 INFO L226 Difference]: Without dead ends: 331 [2022-07-14 05:50:30,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 05:50:30,820 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 573 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:30,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1048 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 05:50:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-14 05:50:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 234. [2022-07-14 05:50:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2022-07-14 05:50:30,824 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 37 [2022-07-14 05:50:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:30,825 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2022-07-14 05:50:30,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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) [2022-07-14 05:50:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2022-07-14 05:50:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:50:30,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:30,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:30,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 05:50:30,826 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2022-07-14 05:50:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:30,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400477512] [2022-07-14 05:50:30,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:30,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:30,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400477512] [2022-07-14 05:50:30,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400477512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:30,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:30,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887939484] [2022-07-14 05:50:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:30,870 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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) [2022-07-14 05:50:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:30,983 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2022-07-14 05:50:30,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:30,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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 [2022-07-14 05:50:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:30,985 INFO L225 Difference]: With dead ends: 233 [2022-07-14 05:50:30,985 INFO L226 Difference]: Without dead ends: 233 [2022-07-14 05:50:30,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:30,985 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:30,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-14 05:50:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-07-14 05:50:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2022-07-14 05:50:30,989 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 37 [2022-07-14 05:50:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:30,989 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2022-07-14 05:50:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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) [2022-07-14 05:50:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2022-07-14 05:50:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:50:30,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:30,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:30,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 05:50:30,990 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2022-07-14 05:50:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:30,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472593901] [2022-07-14 05:50:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:31,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472593901] [2022-07-14 05:50:31,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472593901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:31,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:31,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:50:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52105921] [2022-07-14 05:50:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:31,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:50:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:50:31,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:50:31,040 INFO L87 Difference]: Start difference. First operand 233 states and 277 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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) [2022-07-14 05:50:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:31,171 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2022-07-14 05:50:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:50:31,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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 [2022-07-14 05:50:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:31,172 INFO L225 Difference]: With dead ends: 232 [2022-07-14 05:50:31,172 INFO L226 Difference]: Without dead ends: 232 [2022-07-14 05:50:31,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:31,173 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:31,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 410 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-14 05:50:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-14 05:50:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2022-07-14 05:50:31,177 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 37 [2022-07-14 05:50:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:31,177 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2022-07-14 05:50:31,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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) [2022-07-14 05:50:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2022-07-14 05:50:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 05:50:31,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:31,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:50:31,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 05:50:31,178 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:31,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2022-07-14 05:50:31,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:31,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278762900] [2022-07-14 05:50:31,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:31,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278762900] [2022-07-14 05:50:31,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278762900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:31,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:31,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 05:50:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976229387] [2022-07-14 05:50:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:31,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:50:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:31,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:50:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:50:31,259 INFO L87 Difference]: Start difference. First operand 232 states and 276 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) [2022-07-14 05:50:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:31,436 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2022-07-14 05:50:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 05:50:31,437 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 [2022-07-14 05:50:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:31,438 INFO L225 Difference]: With dead ends: 248 [2022-07-14 05:50:31,438 INFO L226 Difference]: Without dead ends: 248 [2022-07-14 05:50:31,438 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 [2022-07-14 05:50:31,439 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 49 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:31,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 621 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:50:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-14 05:50:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2022-07-14 05:50:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-07-14 05:50:31,443 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 37 [2022-07-14 05:50:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:31,443 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-07-14 05:50:31,444 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) [2022-07-14 05:50:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-07-14 05:50:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 05:50:31,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:31,444 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] [2022-07-14 05:50:31,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 05:50:31,445 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2022-07-14 05:50:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382383225] [2022-07-14 05:50:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:50:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:31,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382383225] [2022-07-14 05:50:31,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382383225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:31,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:31,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:50:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430788546] [2022-07-14 05:50:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:31,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:31,478 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2022-07-14 05:50:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:31,484 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2022-07-14 05:50:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:31,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 [2022-07-14 05:50:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:31,486 INFO L225 Difference]: With dead ends: 242 [2022-07-14 05:50:31,486 INFO L226 Difference]: Without dead ends: 242 [2022-07-14 05:50:31,486 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 [2022-07-14 05:50:31,487 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 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 [2022-07-14 05:50:31,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-14 05:50:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-14 05:50:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2022-07-14 05:50:31,491 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 39 [2022-07-14 05:50:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:31,492 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2022-07-14 05:50:31,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) [2022-07-14 05:50:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2022-07-14 05:50:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 05:50:31,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:31,492 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] [2022-07-14 05:50:31,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 05:50:31,493 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:31,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash -407701739, now seen corresponding path program 1 times [2022-07-14 05:50:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:31,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475742727] [2022-07-14 05:50:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:50:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:50:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:50:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475742727] [2022-07-14 05:50:31,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475742727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:50:31,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:50:31,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:50:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394374946] [2022-07-14 05:50:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:50:31,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:50:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:50:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:50:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:31,519 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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) [2022-07-14 05:50:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:50:31,554 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2022-07-14 05:50:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:50:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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 [2022-07-14 05:50:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:50:31,555 INFO L225 Difference]: With dead ends: 255 [2022-07-14 05:50:31,555 INFO L226 Difference]: Without dead ends: 255 [2022-07-14 05:50:31,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:50:31,556 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:50:31,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:50:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-14 05:50:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2022-07-14 05:50:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:50:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2022-07-14 05:50:31,560 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 39 [2022-07-14 05:50:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:50:31,561 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2022-07-14 05:50:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 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) [2022-07-14 05:50:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2022-07-14 05:50:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 05:50:31,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:50:31,562 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] [2022-07-14 05:50:31,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 05:50:31,562 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2022-07-14 05:50:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:50:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2022-07-14 05:50:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:50:31,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106032152] [2022-07-14 05:50:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:50:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:50:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:50:31,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 05:50:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 05:50:31,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 05:50:31,621 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 05:50:31,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (83 of 84 remaining) [2022-07-14 05:50:31,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 84 remaining) [2022-07-14 05:50:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 84 remaining) [2022-07-14 05:50:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 84 remaining) [2022-07-14 05:50:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 84 remaining) [2022-07-14 05:50:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (78 of 84 remaining) [2022-07-14 05:50:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 84 remaining) [2022-07-14 05:50:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 84 remaining) [2022-07-14 05:50:31,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 84 remaining) [2022-07-14 05:50:31,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 84 remaining) [2022-07-14 05:50:31,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 84 remaining) [2022-07-14 05:50:31,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 84 remaining) [2022-07-14 05:50:31,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 84 remaining) [2022-07-14 05:50:31,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 84 remaining) [2022-07-14 05:50:31,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 84 remaining) [2022-07-14 05:50:31,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 84 remaining) [2022-07-14 05:50:31,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 84 remaining) [2022-07-14 05:50:31,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 84 remaining) [2022-07-14 05:50:31,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 84 remaining) [2022-07-14 05:50:31,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 84 remaining) [2022-07-14 05:50:31,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 84 remaining) [2022-07-14 05:50:31,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 84 remaining) [2022-07-14 05:50:31,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (61 of 84 remaining) [2022-07-14 05:50:31,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 84 remaining) [2022-07-14 05:50:31,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 84 remaining) [2022-07-14 05:50:31,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 84 remaining) [2022-07-14 05:50:31,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 84 remaining) [2022-07-14 05:50:31,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 84 remaining) [2022-07-14 05:50:31,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 84 remaining) [2022-07-14 05:50:31,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 84 remaining) [2022-07-14 05:50:31,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 84 remaining) [2022-07-14 05:50:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 84 remaining) [2022-07-14 05:50:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 84 remaining) [2022-07-14 05:50:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (50 of 84 remaining) [2022-07-14 05:50:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (49 of 84 remaining) [2022-07-14 05:50:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 84 remaining) [2022-07-14 05:50:31,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 84 remaining) [2022-07-14 05:50:31,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 84 remaining) [2022-07-14 05:50:31,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 84 remaining) [2022-07-14 05:50:31,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 84 remaining) [2022-07-14 05:50:31,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 84 remaining) [2022-07-14 05:50:31,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 84 remaining) [2022-07-14 05:50:31,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 84 remaining) [2022-07-14 05:50:31,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 84 remaining) [2022-07-14 05:50:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 84 remaining) [2022-07-14 05:50:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (32 of 84 remaining) [2022-07-14 05:50:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (31 of 84 remaining) [2022-07-14 05:50:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 84 remaining) [2022-07-14 05:50:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 84 remaining) [2022-07-14 05:50:31,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (28 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (25 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 84 remaining) [2022-07-14 05:50:31,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 84 remaining) [2022-07-14 05:50:31,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (20 of 84 remaining) [2022-07-14 05:50:31,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 84 remaining) [2022-07-14 05:50:31,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 84 remaining) [2022-07-14 05:50:31,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 84 remaining) [2022-07-14 05:50:31,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 84 remaining) [2022-07-14 05:50:31,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK (15 of 84 remaining) [2022-07-14 05:50:31,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 84 remaining) [2022-07-14 05:50:31,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 84 remaining) [2022-07-14 05:50:31,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (12 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK (9 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (8 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (7 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (6 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 84 remaining) [2022-07-14 05:50:31,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE (3 of 84 remaining) [2022-07-14 05:50:31,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (2 of 84 remaining) [2022-07-14 05:50:31,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (1 of 84 remaining) [2022-07-14 05:50:31,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (0 of 84 remaining) [2022-07-14 05:50:31,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 05:50:31,640 INFO L356 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] [2022-07-14 05:50:31,643 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 05:50:31,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 05:50:31 BoogieIcfgContainer [2022-07-14 05:50:31,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 05:50:31,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 05:50:31,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 05:50:31,680 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 05:50:31,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:50:14" (3/4) ... [2022-07-14 05:50:31,681 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 05:50:31,717 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 05:50:31,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 05:50:31,718 INFO L158 Benchmark]: Toolchain (without parser) took 18254.71ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 56.8MB in the beginning and 31.8MB in the end (delta: 25.0MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,718 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 05:50:31,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.64ms. Allocated memory is still 88.1MB. Free memory was 56.5MB in the beginning and 37.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.61ms. Allocated memory is still 88.1MB. Free memory was 37.1MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,719 INFO L158 Benchmark]: Boogie Preprocessor took 30.58ms. Allocated memory is still 88.1MB. Free memory was 34.7MB in the beginning and 32.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,719 INFO L158 Benchmark]: RCFGBuilder took 735.61ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 32.4MB in the beginning and 65.0MB in the end (delta: -32.5MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,719 INFO L158 Benchmark]: TraceAbstraction took 16967.08ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 64.6MB in the beginning and 33.9MB in the end (delta: 30.7MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,720 INFO L158 Benchmark]: Witness Printer took 37.85ms. Allocated memory is still 134.2MB. Free memory was 33.9MB in the beginning and 31.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 05:50:31,721 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.20ms. Allocated memory is still 88.1MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.64ms. Allocated memory is still 88.1MB. Free memory was 56.5MB in the beginning and 37.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.61ms. Allocated memory is still 88.1MB. Free memory was 37.1MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.58ms. Allocated memory is still 88.1MB. Free memory was 34.7MB in the beginning and 32.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 735.61ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 32.4MB in the beginning and 65.0MB in the end (delta: -32.5MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16967.08ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 64.6MB in the beginning and 33.9MB in the end (delta: 30.7MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 37.85ms. Allocated memory is still 134.2MB. Free memory was 33.9MB in the beginning and 31.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] 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] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - 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: 1006]: 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: 1006]: 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: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: 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: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: 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: 1038]: 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: 1039]: 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: 1043]: 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: 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: -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: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: 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: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: 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, 200 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5647 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5647 mSDsluCounter, 14036 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 98 IncrementalHoareTripleChecker+Unchecked, 9995 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7263 IncrementalHoareTripleChecker+Invalid, 7715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 4041 mSDtfsCounter, 7263 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=30, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 919 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 752 ConstructedInterpolants, 17 QuantifiedInterpolants, 6557 SizeOfPredicates, 9 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 29 PerfectInterpolantSequences, 5/8 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! [2022-07-14 05:50:31,769 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-memcleanup)