./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:43:36,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:43:36,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:43:36,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:43:36,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:43:36,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:43:36,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:43:36,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:43:36,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:43:36,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:43:36,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:43:36,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:43:36,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:43:36,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:43:36,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:43:36,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:43:36,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:43:36,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:43:36,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:43:36,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:43:36,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:43:36,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:43:36,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:43:36,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:43:36,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:43:36,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:43:36,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:43:36,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:43:36,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:43:36,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:43:36,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:43:36,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:43:36,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:43:36,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:43:36,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:43:36,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:43:36,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:43:36,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:43:36,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:43:36,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:43:36,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:43:36,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:43:36,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:43:36,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:43:36,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:43:36,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:43:36,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:43:36,259 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:43:36,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:43:36,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:43:36,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:43:36,261 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:43:36,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:43:36,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:43:36,262 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:43:36,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:43:36,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:43:36,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:43:36,263 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:43:36,263 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:43:36,263 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:43:36,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:43:36,265 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:43:36,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:43:36,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:43:36,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:43:36,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:43:36,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:43:36,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:43:36,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:43:36,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:43:36,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:43:36,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:43:36,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-14 06:43:36,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:43:36,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:43:36,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:43:36,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:43:36,562 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:43:36,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-14 06:43:36,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cc29368/15f3784272ba447ba45e319adb27a9d2/FLAG6f7646262 [2022-07-14 06:43:37,108 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:43:37,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-14 06:43:37,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cc29368/15f3784272ba447ba45e319adb27a9d2/FLAG6f7646262 [2022-07-14 06:43:37,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cc29368/15f3784272ba447ba45e319adb27a9d2 [2022-07-14 06:43:37,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:43:37,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:43:37,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:43:37,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:43:37,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:43:37,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:37,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbfc1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37, skipping insertion in model container [2022-07-14 06:43:37,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:37,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:43:37,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:43:37,833 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/sll-01-1.i[22034,22047] [2022-07-14 06:43:37,845 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/sll-01-1.i[22307,22320] [2022-07-14 06:43:37,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/sll-01-1.i[22516,22529] [2022-07-14 06:43:37,850 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/sll-01-1.i[22586,22599] [2022-07-14 06:43:37,857 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/sll-01-1.i[22853,22866] [2022-07-14 06:43:37,859 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/sll-01-1.i[22961,22974] [2022-07-14 06:43:37,861 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/sll-01-1.i[23192,23205] [2022-07-14 06:43:37,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/sll-01-1.i[23272,23285] [2022-07-14 06:43:37,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/sll-01-1.i[23351,23364] [2022-07-14 06:43:37,867 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/sll-01-1.i[23441,23454] [2022-07-14 06:43:37,872 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/sll-01-1.i[23619,23632] [2022-07-14 06:43:37,874 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/sll-01-1.i[23697,23710] [2022-07-14 06:43:37,876 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/sll-01-1.i[23774,23787] [2022-07-14 06:43:37,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:43:37,896 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:43:37,931 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/sll-01-1.i[22034,22047] [2022-07-14 06:43:37,938 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/sll-01-1.i[22307,22320] [2022-07-14 06:43:37,945 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/sll-01-1.i[22516,22529] [2022-07-14 06:43:37,946 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/sll-01-1.i[22586,22599] [2022-07-14 06:43:37,948 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/sll-01-1.i[22853,22866] [2022-07-14 06:43:37,949 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/sll-01-1.i[22961,22974] [2022-07-14 06:43:37,950 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/sll-01-1.i[23192,23205] [2022-07-14 06:43:37,951 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/sll-01-1.i[23272,23285] [2022-07-14 06:43:37,952 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/sll-01-1.i[23351,23364] [2022-07-14 06:43:37,952 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/sll-01-1.i[23441,23454] [2022-07-14 06:43:37,953 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/sll-01-1.i[23619,23632] [2022-07-14 06:43:37,954 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/sll-01-1.i[23697,23710] [2022-07-14 06:43:37,954 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/sll-01-1.i[23774,23787] [2022-07-14 06:43:37,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:43:37,977 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:43:37,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37 WrapperNode [2022-07-14 06:43:37,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:43:37,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:43:37,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:43:37,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:43:37,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,040 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2022-07-14 06:43:38,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:43:38,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:43:38,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:43:38,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:43:38,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:43:38,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:43:38,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:43:38,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:43:38,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (1/1) ... [2022-07-14 06:43:38,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:43:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:38,113 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 06:43:38,115 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 06:43:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:43:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:43:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:43:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:43:38,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:43:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:43:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:43:38,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:43:38,222 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:43:38,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:43:38,671 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:43:38,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:43:38,686 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-14 06:43:38,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:43:38 BoogieIcfgContainer [2022-07-14 06:43:38,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:43:38,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:43:38,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:43:38,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:43:38,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:43:37" (1/3) ... [2022-07-14 06:43:38,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efa2ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:43:38, skipping insertion in model container [2022-07-14 06:43:38,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:43:37" (2/3) ... [2022-07-14 06:43:38,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efa2ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:43:38, skipping insertion in model container [2022-07-14 06:43:38,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:43:38" (3/3) ... [2022-07-14 06:43:38,701 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-14 06:43:38,715 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:43:38,715 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2022-07-14 06:43:38,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:43:38,782 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@a393401, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ae35c93 [2022-07-14 06:43:38,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2022-07-14 06:43:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:43:38,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:38,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:43:38,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:43:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:38,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92310842] [2022-07-14 06:43:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:38,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:38,964 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 06:43:38,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:38,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92310842] [2022-07-14 06:43:38,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92310842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:38,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:38,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:43:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207307820] [2022-07-14 06:43:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:38,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:39,003 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 06:43:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:39,175 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2022-07-14 06:43:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:39,177 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 06:43:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:39,185 INFO L225 Difference]: With dead ends: 192 [2022-07-14 06:43:39,185 INFO L226 Difference]: Without dead ends: 188 [2022-07-14 06:43:39,187 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 06:43:39,190 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:39,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-14 06:43:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-07-14 06:43:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 0 states have call successors, (0), 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 06:43:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-07-14 06:43:39,229 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2022-07-14 06:43:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:39,229 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-07-14 06:43:39,229 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 06:43:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-07-14 06:43:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:43:39,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:39,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:43:39,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:43:39,231 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:39,232 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:43:39,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:39,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280462035] [2022-07-14 06:43:39,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:39,272 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 06:43:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:39,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280462035] [2022-07-14 06:43:39,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280462035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:39,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:39,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:43:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112428318] [2022-07-14 06:43:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:39,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:39,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:39,282 INFO L87 Difference]: Start difference. First operand 183 states and 195 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 06:43:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:39,410 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-07-14 06:43:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:39,412 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 06:43:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:39,417 INFO L225 Difference]: With dead ends: 213 [2022-07-14 06:43:39,423 INFO L226 Difference]: Without dead ends: 213 [2022-07-14 06:43:39,424 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 06:43:39,426 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:39,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-14 06:43:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2022-07-14 06:43:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2022-07-14 06:43:39,453 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2022-07-14 06:43:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:39,454 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2022-07-14 06:43:39,454 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 06:43:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2022-07-14 06:43:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:43:39,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:39,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:43:39,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:43:39,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:39,466 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2022-07-14 06:43:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:39,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238696657] [2022-07-14 06:43:39,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:39,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:39,510 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 06:43:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:39,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238696657] [2022-07-14 06:43:39,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238696657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:39,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:39,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817073888] [2022-07-14 06:43:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:39,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:39,518 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:39,551 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2022-07-14 06:43:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:39,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 06:43:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:39,553 INFO L225 Difference]: With dead ends: 208 [2022-07-14 06:43:39,553 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 06:43:39,553 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 06:43:39,559 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:39,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 06:43:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-07-14 06:43:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2022-07-14 06:43:39,576 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2022-07-14 06:43:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:39,576 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2022-07-14 06:43:39,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-07-14 06:43:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:43:39,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:39,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:39,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:43:39,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2022-07-14 06:43:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:39,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455513956] [2022-07-14 06:43:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:39,634 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 06:43:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:39,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455513956] [2022-07-14 06:43:39,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455513956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:39,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:39,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:43:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318405288] [2022-07-14 06:43:39,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:39,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:39,638 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:39,810 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-07-14 06:43:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:43:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 06:43:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:39,812 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:43:39,812 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 06:43:39,813 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 06:43:39,817 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:39,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 06:43:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-14 06:43:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 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 06:43:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-07-14 06:43:39,834 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2022-07-14 06:43:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:39,835 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-07-14 06:43:39,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-07-14 06:43:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:43:39,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:39,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:39,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:43:39,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2022-07-14 06:43:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:39,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236282339] [2022-07-14 06:43:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:39,908 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 06:43:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:39,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236282339] [2022-07-14 06:43:39,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236282339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:39,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:39,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:43:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790870267] [2022-07-14 06:43:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:39,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:39,916 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:40,069 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-07-14 06:43:40,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:43:40,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 06:43:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:40,072 INFO L225 Difference]: With dead ends: 189 [2022-07-14 06:43:40,072 INFO L226 Difference]: Without dead ends: 189 [2022-07-14 06:43:40,072 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 06:43:40,073 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 2 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:40,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 529 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-14 06:43:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-07-14 06:43:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-07-14 06:43:40,085 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2022-07-14 06:43:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-07-14 06:43:40,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-07-14 06:43:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:43:40,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:40,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:40,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:43:40,087 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2022-07-14 06:43:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:40,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509470122] [2022-07-14 06:43:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:40,162 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 06:43:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:40,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509470122] [2022-07-14 06:43:40,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509470122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:40,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:40,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135492778] [2022-07-14 06:43:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:40,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:40,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:40,165 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:40,176 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2022-07-14 06:43:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:43:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:40,177 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:43:40,178 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 06:43:40,178 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 06:43:40,179 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 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 06:43:40,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 06:43:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-14 06:43:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 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 06:43:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2022-07-14 06:43:40,184 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2022-07-14 06:43:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:40,185 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2022-07-14 06:43:40,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2022-07-14 06:43:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:43:40,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:40,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:40,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:43:40,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2022-07-14 06:43:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:40,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219065314] [2022-07-14 06:43:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:40,299 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 06:43:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219065314] [2022-07-14 06:43:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219065314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:40,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:40,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:43:40,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330189401] [2022-07-14 06:43:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:40,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:43:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:43:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:43:40,302 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:40,556 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-07-14 06:43:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:43:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:43:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:40,557 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:43:40,557 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 06:43:40,558 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 06:43:40,558 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:40,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 441 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 06:43:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2022-07-14 06:43:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2022-07-14 06:43:40,562 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2022-07-14 06:43:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:40,562 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2022-07-14 06:43:40,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2022-07-14 06:43:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:43:40,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:40,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:40,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:43:40,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:40,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2022-07-14 06:43:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:40,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648099728] [2022-07-14 06:43:40,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:40,675 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 06:43:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648099728] [2022-07-14 06:43:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648099728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:40,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:40,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:43:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753454648] [2022-07-14 06:43:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:43:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:43:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:43:40,678 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:40,991 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2022-07-14 06:43:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:43:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:43:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:40,993 INFO L225 Difference]: With dead ends: 189 [2022-07-14 06:43:40,993 INFO L226 Difference]: Without dead ends: 189 [2022-07-14 06:43:40,993 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 06:43:40,994 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:40,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 479 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-14 06:43:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-07-14 06:43:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 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 06:43:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-14 06:43:40,997 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2022-07-14 06:43:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:40,998 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-14 06:43:40,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-14 06:43:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:43:40,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:40,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:40,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:43:40,998 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:40,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2022-07-14 06:43:41,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:41,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276987798] [2022-07-14 06:43:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:41,108 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 06:43:41,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:41,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276987798] [2022-07-14 06:43:41,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276987798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:41,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:41,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:43:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919897480] [2022-07-14 06:43:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:41,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:43:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:43:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:43:41,111 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:41,294 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2022-07-14 06:43:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:43:41,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:43:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:41,295 INFO L225 Difference]: With dead ends: 275 [2022-07-14 06:43:41,295 INFO L226 Difference]: Without dead ends: 275 [2022-07-14 06:43:41,295 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 06:43:41,296 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 193 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 699 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-14 06:43:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2022-07-14 06:43:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 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 06:43:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-07-14 06:43:41,300 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2022-07-14 06:43:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:41,300 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-07-14 06:43:41,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-07-14 06:43:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:43:41,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:41,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:41,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:43:41,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2022-07-14 06:43:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914747644] [2022-07-14 06:43:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:41,361 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 06:43:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914747644] [2022-07-14 06:43:41,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914747644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:41,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:41,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802753066] [2022-07-14 06:43:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:41,364 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:41,471 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2022-07-14 06:43:41,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:43:41,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:43:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:41,473 INFO L225 Difference]: With dead ends: 276 [2022-07-14 06:43:41,473 INFO L226 Difference]: Without dead ends: 276 [2022-07-14 06:43:41,473 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 06:43:41,474 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:41,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-14 06:43:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2022-07-14 06:43:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 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 06:43:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-14 06:43:41,479 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2022-07-14 06:43:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:41,479 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-14 06:43:41,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-14 06:43:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:43:41,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:41,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:41,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:43:41,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2022-07-14 06:43:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:41,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792001174] [2022-07-14 06:43:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:41,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:41,546 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 06:43:41,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:41,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792001174] [2022-07-14 06:43:41,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792001174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:41,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:41,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42985918] [2022-07-14 06:43:41,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:41,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:41,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:41,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:41,548 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:41,737 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2022-07-14 06:43:41,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:43:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 06:43:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:41,738 INFO L225 Difference]: With dead ends: 248 [2022-07-14 06:43:41,739 INFO L226 Difference]: Without dead ends: 248 [2022-07-14 06:43:41,739 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 06:43:41,739 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 488 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:41,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 186 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-14 06:43:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2022-07-14 06:43:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.603896103896104) internal successors, (247), 210 states have internal predecessors, (247), 0 states have call successors, (0), 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 06:43:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2022-07-14 06:43:41,745 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 19 [2022-07-14 06:43:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:41,745 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2022-07-14 06:43:41,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2022-07-14 06:43:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:43:41,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:41,748 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] [2022-07-14 06:43:41,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:43:41,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2022-07-14 06:43:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:41,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631072641] [2022-07-14 06:43:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:41,795 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 06:43:41,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:41,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631072641] [2022-07-14 06:43:41,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631072641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:41,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:41,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:43:41,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093922517] [2022-07-14 06:43:41,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:41,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:43:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:41,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:43:41,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:43:41,798 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:41,904 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2022-07-14 06:43:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:43:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:43:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:41,908 INFO L225 Difference]: With dead ends: 243 [2022-07-14 06:43:41,908 INFO L226 Difference]: Without dead ends: 243 [2022-07-14 06:43:41,908 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 06:43:41,909 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 228 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:41,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 277 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-14 06:43:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-07-14 06:43:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5947712418300655) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 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 06:43:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2022-07-14 06:43:41,916 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 21 [2022-07-14 06:43:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:41,916 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2022-07-14 06:43:41,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2022-07-14 06:43:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:43:41,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:41,924 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 06:43:41,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:43:41,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2022-07-14 06:43:41,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:41,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199512986] [2022-07-14 06:43:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:41,989 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 06:43:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:41,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199512986] [2022-07-14 06:43:41,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199512986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:41,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:41,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581184083] [2022-07-14 06:43:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:41,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:41,991 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:42,163 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-07-14 06:43:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:43:42,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:43:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:42,165 INFO L225 Difference]: With dead ends: 198 [2022-07-14 06:43:42,165 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 06:43:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:43:42,166 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:42,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 06:43:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-07-14 06:43:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 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 06:43:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2022-07-14 06:43:42,170 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2022-07-14 06:43:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:42,171 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2022-07-14 06:43:42,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2022-07-14 06:43:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:43:42,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:42,172 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 06:43:42,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:43:42,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2022-07-14 06:43:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:42,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070611200] [2022-07-14 06:43:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:42,235 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 06:43:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070611200] [2022-07-14 06:43:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070611200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224025497] [2022-07-14 06:43:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:42,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:42,238 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:42,463 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2022-07-14 06:43:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:43:42,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:43:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:42,465 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:43:42,465 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 06:43:42,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:43:42,466 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:42,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 06:43:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2022-07-14 06:43:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 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 06:43:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-07-14 06:43:42,469 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-07-14 06:43:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-07-14 06:43:42,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-07-14 06:43:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:43:42,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:42,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:42,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:43:42,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2022-07-14 06:43:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:42,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170110305] [2022-07-14 06:43:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:42,528 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 06:43:42,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:42,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170110305] [2022-07-14 06:43:42,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170110305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:42,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:42,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:43:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115087821] [2022-07-14 06:43:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:42,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:42,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:42,531 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:42,658 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2022-07-14 06:43:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:43:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:43:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:42,661 INFO L225 Difference]: With dead ends: 186 [2022-07-14 06:43:42,661 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 06:43:42,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:43:42,664 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:42,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 06:43:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2022-07-14 06:43:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2022-07-14 06:43:42,668 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2022-07-14 06:43:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:42,669 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2022-07-14 06:43:42,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2022-07-14 06:43:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:43:42,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:42,675 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 06:43:42,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:43:42,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2022-07-14 06:43:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:42,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569043266] [2022-07-14 06:43:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:42,708 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 06:43:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:42,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569043266] [2022-07-14 06:43:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569043266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:42,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:42,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544830115] [2022-07-14 06:43:42,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:42,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:42,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:42,713 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:42,721 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2022-07-14 06:43:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:43:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:42,723 INFO L225 Difference]: With dead ends: 252 [2022-07-14 06:43:42,723 INFO L226 Difference]: Without dead ends: 252 [2022-07-14 06:43:42,724 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 06:43:42,724 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 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 06:43:42,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-14 06:43:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2022-07-14 06:43:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 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 06:43:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2022-07-14 06:43:42,730 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2022-07-14 06:43:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:42,730 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2022-07-14 06:43:42,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-07-14 06:43:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:43:42,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:42,732 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 06:43:42,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:43:42,732 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:42,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2022-07-14 06:43:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:42,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482097395] [2022-07-14 06:43:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:42,777 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 06:43:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482097395] [2022-07-14 06:43:42,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482097395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:42,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:42,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036629914] [2022-07-14 06:43:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:42,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:42,780 INFO L87 Difference]: Start difference. First operand 185 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 06:43:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:42,793 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-07-14 06:43:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:42,793 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 06:43:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:42,795 INFO L225 Difference]: With dead ends: 183 [2022-07-14 06:43:42,795 INFO L226 Difference]: Without dead ends: 183 [2022-07-14 06:43:42,795 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 06:43:42,796 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 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 06:43:42,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-14 06:43:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-07-14 06:43:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-07-14 06:43:42,800 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2022-07-14 06:43:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:42,801 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-07-14 06:43:42,801 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 06:43:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-07-14 06:43:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:43:42,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:42,802 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 06:43:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:43:42,802 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2022-07-14 06:43:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:42,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109765926] [2022-07-14 06:43:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:42,925 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 06:43:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:42,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109765926] [2022-07-14 06:43:42,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109765926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:42,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:42,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:43:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119949007] [2022-07-14 06:43:42,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:42,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:43:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:43:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:43:42,928 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:43,271 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2022-07-14 06:43:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:43:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 06:43:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:43,273 INFO L225 Difference]: With dead ends: 308 [2022-07-14 06:43:43,273 INFO L226 Difference]: Without dead ends: 308 [2022-07-14 06:43:43,274 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 06:43:43,274 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 390 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:43,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 783 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-14 06:43:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2022-07-14 06:43:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 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 06:43:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-07-14 06:43:43,280 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2022-07-14 06:43:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:43,280 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-07-14 06:43:43,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-07-14 06:43:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:43:43,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:43,281 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] [2022-07-14 06:43:43,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:43:43,282 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:43,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2022-07-14 06:43:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:43,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453768472] [2022-07-14 06:43:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:43,340 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 06:43:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:43,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453768472] [2022-07-14 06:43:43,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453768472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:43:43,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492831489] [2022-07-14 06:43:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:43,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:43,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:43,347 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 06:43:43,369 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 06:43:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:43,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:43:43,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:43:43,568 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 06:43:43,602 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 06:43:43,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:43:43,673 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 06:43:43,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:43:43,680 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 06:43:43,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:43,814 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 06:43:43,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:43,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:43:43,821 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 06:43:43,830 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 06:43:43,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:43:44,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-07-14 06:43:44,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:44,970 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 06:43:44,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-07-14 06:43:44,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:43:44,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:44,995 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 06:43:44,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492831489] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:43:44,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:43:44,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2022-07-14 06:43:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554033059] [2022-07-14 06:43:44,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:43:44,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:43:44,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:43:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2022-07-14 06:43:44,998 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:45,581 INFO L93 Difference]: Finished difference Result 481 states and 540 transitions. [2022-07-14 06:43:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:43:45,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 06:43:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:45,584 INFO L225 Difference]: With dead ends: 481 [2022-07-14 06:43:45,584 INFO L226 Difference]: Without dead ends: 481 [2022-07-14 06:43:45,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=451, Unknown=1, NotChecked=0, Total=600 [2022-07-14 06:43:45,585 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 812 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:45,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1240 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 428 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2022-07-14 06:43:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-07-14 06:43:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 251. [2022-07-14 06:43:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 states have internal predecessors, (302), 0 states have call successors, (0), 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 06:43:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2022-07-14 06:43:45,591 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2022-07-14 06:43:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:45,591 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2022-07-14 06:43:45,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2022-07-14 06:43:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:43:45,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:45,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:45,619 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 06:43:45,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:45,808 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2022-07-14 06:43:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:45,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570571622] [2022-07-14 06:43:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:45,850 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 06:43:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570571622] [2022-07-14 06:43:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570571622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:45,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:45,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:43:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649716569] [2022-07-14 06:43:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:45,852 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:45,973 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2022-07-14 06:43:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:43:45,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 06:43:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:45,974 INFO L225 Difference]: With dead ends: 250 [2022-07-14 06:43:45,975 INFO L226 Difference]: Without dead ends: 250 [2022-07-14 06:43:45,975 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 06:43:45,975 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:45,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 408 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-14 06:43:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-07-14 06:43:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 0 states have call successors, (0), 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 06:43:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2022-07-14 06:43:45,980 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2022-07-14 06:43:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:45,980 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2022-07-14 06:43:45,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2022-07-14 06:43:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:43:45,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:45,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:45,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:43:45,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2022-07-14 06:43:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:45,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234599502] [2022-07-14 06:43:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:46,031 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 06:43:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:46,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234599502] [2022-07-14 06:43:46,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234599502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:46,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:46,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:43:46,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401938914] [2022-07-14 06:43:46,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:46,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:46,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:46,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:46,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:46,034 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:46,159 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-07-14 06:43:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:43:46,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 06:43:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:46,161 INFO L225 Difference]: With dead ends: 249 [2022-07-14 06:43:46,161 INFO L226 Difference]: Without dead ends: 249 [2022-07-14 06:43:46,161 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 06:43:46,162 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:46,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 411 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-14 06:43:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-07-14 06:43:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 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 06:43:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-07-14 06:43:46,167 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2022-07-14 06:43:46,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:46,167 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-07-14 06:43:46,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-07-14 06:43:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:43:46,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:46,168 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] [2022-07-14 06:43:46,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:43:46,169 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2022-07-14 06:43:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:46,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757880129] [2022-07-14 06:43:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:46,275 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 06:43:46,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:46,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757880129] [2022-07-14 06:43:46,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757880129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:46,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:46,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:43:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710784368] [2022-07-14 06:43:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:46,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:43:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:43:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:43:46,277 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:46,804 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2022-07-14 06:43:46,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:43:46,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 06:43:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:46,806 INFO L225 Difference]: With dead ends: 364 [2022-07-14 06:43:46,806 INFO L226 Difference]: Without dead ends: 364 [2022-07-14 06:43:46,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:43:46,807 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 491 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:46,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 973 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:43:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-14 06:43:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 250. [2022-07-14 06:43:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 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 06:43:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2022-07-14 06:43:46,813 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2022-07-14 06:43:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:46,813 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2022-07-14 06:43:46,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2022-07-14 06:43:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:43:46,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:46,814 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] [2022-07-14 06:43:46,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:43:46,815 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2022-07-14 06:43:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:46,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690847594] [2022-07-14 06:43:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:47,031 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 06:43:47,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:47,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690847594] [2022-07-14 06:43:47,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690847594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:47,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:47,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:43:47,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586886638] [2022-07-14 06:43:47,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:47,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:43:47,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:47,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:43:47,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:43:47,033 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:47,671 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2022-07-14 06:43:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:43:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 06:43:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:47,674 INFO L225 Difference]: With dead ends: 428 [2022-07-14 06:43:47,674 INFO L226 Difference]: Without dead ends: 428 [2022-07-14 06:43:47,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:43:47,674 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 739 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:47,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 922 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:43:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-14 06:43:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 256. [2022-07-14 06:43:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 states have internal predecessors, (305), 0 states have call successors, (0), 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 06:43:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2022-07-14 06:43:47,680 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2022-07-14 06:43:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:47,680 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2022-07-14 06:43:47,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2022-07-14 06:43:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 06:43:47,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:47,681 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 06:43:47,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:43:47,681 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2022-07-14 06:43:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:47,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639704214] [2022-07-14 06:43:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:47,705 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 06:43:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:47,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639704214] [2022-07-14 06:43:47,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639704214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:47,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:47,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170080454] [2022-07-14 06:43:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:47,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:47,708 INFO L87 Difference]: Start difference. First operand 256 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:47,715 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2022-07-14 06:43:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:47,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-14 06:43:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:47,716 INFO L225 Difference]: With dead ends: 258 [2022-07-14 06:43:47,716 INFO L226 Difference]: Without dead ends: 258 [2022-07-14 06:43:47,717 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 06:43:47,717 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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 06:43:47,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-14 06:43:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-07-14 06:43:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 0 states have call successors, (0), 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 06:43:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2022-07-14 06:43:47,723 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2022-07-14 06:43:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:47,723 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2022-07-14 06:43:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2022-07-14 06:43:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:43:47,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:47,724 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] [2022-07-14 06:43:47,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 06:43:47,724 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2022-07-14 06:43:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:47,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421166168] [2022-07-14 06:43:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:47,961 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 06:43:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421166168] [2022-07-14 06:43:47,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421166168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:47,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:43:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405424955] [2022-07-14 06:43:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:47,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:43:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:43:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:43:47,962 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:48,697 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2022-07-14 06:43:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:43:48,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:43:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:48,699 INFO L225 Difference]: With dead ends: 420 [2022-07-14 06:43:48,699 INFO L226 Difference]: Without dead ends: 420 [2022-07-14 06:43:48,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:43:48,700 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 553 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:48,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1234 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:43:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-14 06:43:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2022-07-14 06:43:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 0 states have call successors, (0), 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 06:43:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2022-07-14 06:43:48,705 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2022-07-14 06:43:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:48,706 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2022-07-14 06:43:48,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2022-07-14 06:43:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:43:48,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:48,707 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] [2022-07-14 06:43:48,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 06:43:48,707 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2022-07-14 06:43:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:48,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427775115] [2022-07-14 06:43:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:48,776 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 06:43:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:48,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427775115] [2022-07-14 06:43:48,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427775115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:48,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:48,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:43:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899068187] [2022-07-14 06:43:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:48,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:43:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:43:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:43:48,779 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:48,964 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2022-07-14 06:43:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:43:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:43:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:48,966 INFO L225 Difference]: With dead ends: 273 [2022-07-14 06:43:48,966 INFO L226 Difference]: Without dead ends: 273 [2022-07-14 06:43:48,966 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 06:43:48,967 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 608 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-14 06:43:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2022-07-14 06:43:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 0 states have call successors, (0), 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 06:43:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2022-07-14 06:43:48,972 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2022-07-14 06:43:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:48,972 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2022-07-14 06:43:48,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2022-07-14 06:43:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:43:48,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:48,973 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] [2022-07-14 06:43:48,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 06:43:48,974 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2022-07-14 06:43:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:48,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383798917] [2022-07-14 06:43:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:49,065 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 06:43:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383798917] [2022-07-14 06:43:49,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383798917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:49,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:49,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:43:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365495043] [2022-07-14 06:43:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:43:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:43:49,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:43:49,068 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:49,387 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2022-07-14 06:43:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:43:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:43:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:49,389 INFO L225 Difference]: With dead ends: 267 [2022-07-14 06:43:49,389 INFO L226 Difference]: Without dead ends: 267 [2022-07-14 06:43:49,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:43:49,390 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:49,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 721 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-14 06:43:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2022-07-14 06:43:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 0 states have call successors, (0), 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 06:43:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2022-07-14 06:43:49,396 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2022-07-14 06:43:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:49,396 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2022-07-14 06:43:49,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2022-07-14 06:43:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:43:49,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:49,397 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] [2022-07-14 06:43:49,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:43:49,397 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2022-07-14 06:43:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:49,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225512089] [2022-07-14 06:43:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:49,533 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 06:43:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:49,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225512089] [2022-07-14 06:43:49,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225512089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:49,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:49,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:43:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671028594] [2022-07-14 06:43:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:49,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:43:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:43:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:43:49,536 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:49,927 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2022-07-14 06:43:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:43:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:43:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:49,928 INFO L225 Difference]: With dead ends: 266 [2022-07-14 06:43:49,928 INFO L226 Difference]: Without dead ends: 266 [2022-07-14 06:43:49,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:43:49,929 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:49,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 786 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:43:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-14 06:43:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2022-07-14 06:43:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 0 states have call successors, (0), 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 06:43:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2022-07-14 06:43:49,934 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2022-07-14 06:43:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:49,934 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2022-07-14 06:43:49,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2022-07-14 06:43:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:43:49,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:49,935 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 06:43:49,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 06:43:49,935 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2022-07-14 06:43:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:49,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370786735] [2022-07-14 06:43:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:50,001 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 06:43:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370786735] [2022-07-14 06:43:50,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370786735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:50,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:50,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:43:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530971501] [2022-07-14 06:43:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:43:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:43:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:43:50,003 INFO L87 Difference]: Start difference. First operand 265 states and 313 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 06:43:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:50,177 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2022-07-14 06:43:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:43:50,177 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 06:43:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:50,178 INFO L225 Difference]: With dead ends: 275 [2022-07-14 06:43:50,178 INFO L226 Difference]: Without dead ends: 275 [2022-07-14 06:43:50,179 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 06:43:50,179 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 31 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:50,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 564 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-14 06:43:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-07-14 06:43:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 states have internal predecessors, (308), 0 states have call successors, (0), 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 06:43:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2022-07-14 06:43:50,184 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2022-07-14 06:43:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:50,184 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2022-07-14 06:43:50,184 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 06:43:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2022-07-14 06:43:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:43:50,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:50,185 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] [2022-07-14 06:43:50,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:43:50,185 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2022-07-14 06:43:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:50,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127734678] [2022-07-14 06:43:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:50,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:50,216 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 06:43:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:50,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127734678] [2022-07-14 06:43:50,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127734678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:50,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:50,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:43:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107030542] [2022-07-14 06:43:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:50,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:50,219 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:50,247 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2022-07-14 06:43:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:43:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:50,249 INFO L225 Difference]: With dead ends: 274 [2022-07-14 06:43:50,249 INFO L226 Difference]: Without dead ends: 274 [2022-07-14 06:43:50,249 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 06:43:50,249 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:50,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-14 06:43:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2022-07-14 06:43:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 states have internal predecessors, (309), 0 states have call successors, (0), 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 06:43:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2022-07-14 06:43:50,267 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2022-07-14 06:43:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2022-07-14 06:43:50,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2022-07-14 06:43:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:43:50,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:50,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 06:43:50,270 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2022-07-14 06:43:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251987571] [2022-07-14 06:43:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:50,530 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 06:43:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:50,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251987571] [2022-07-14 06:43:50,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251987571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:50,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:50,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 06:43:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741243676] [2022-07-14 06:43:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:50,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:43:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:43:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:43:50,532 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:51,207 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-07-14 06:43:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:43:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:43:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:51,209 INFO L225 Difference]: With dead ends: 422 [2022-07-14 06:43:51,209 INFO L226 Difference]: Without dead ends: 422 [2022-07-14 06:43:51,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:43:51,210 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 818 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:51,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1059 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:43:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-14 06:43:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2022-07-14 06:43:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 states have internal predecessors, (308), 0 states have call successors, (0), 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 06:43:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2022-07-14 06:43:51,216 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2022-07-14 06:43:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:51,216 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2022-07-14 06:43:51,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2022-07-14 06:43:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:43:51,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:51,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 06:43:51,217 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2022-07-14 06:43:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:51,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700003250] [2022-07-14 06:43:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:51,248 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 06:43:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700003250] [2022-07-14 06:43:51,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700003250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:51,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:51,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244109707] [2022-07-14 06:43:51,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:51,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:51,250 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:51,293 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2022-07-14 06:43:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:43:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:51,294 INFO L225 Difference]: With dead ends: 264 [2022-07-14 06:43:51,294 INFO L226 Difference]: Without dead ends: 264 [2022-07-14 06:43:51,295 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 06:43:51,295 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:51,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-14 06:43:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2022-07-14 06:43:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 states have internal predecessors, (305), 0 states have call successors, (0), 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 06:43:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2022-07-14 06:43:51,306 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2022-07-14 06:43:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:51,306 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2022-07-14 06:43:51,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2022-07-14 06:43:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:43:51,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:51,307 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:51,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 06:43:51,308 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2022-07-14 06:43:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:51,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435351335] [2022-07-14 06:43:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435351335] [2022-07-14 06:43:51,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435351335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:43:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521830674] [2022-07-14 06:43:51,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:51,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:51,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:43:51,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:43:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:51,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:43:51,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:43:51,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:43:51,543 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 06:43:51,571 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:43:51,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:43:51,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:43:51,576 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 06:43:51,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:43:51,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:43:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:43:51,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:43:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:43:51,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521830674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:43:51,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:43:51,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2022-07-14 06:43:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889780955] [2022-07-14 06:43:51,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:43:51,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:43:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:43:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:43:51,765 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:52,107 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2022-07-14 06:43:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:43:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:43:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:52,109 INFO L225 Difference]: With dead ends: 352 [2022-07-14 06:43:52,109 INFO L226 Difference]: Without dead ends: 352 [2022-07-14 06:43:52,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:43:52,109 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:52,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 802 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-07-14 06:43:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2022-07-14 06:43:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 0 states have call successors, (0), 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 06:43:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2022-07-14 06:43:52,115 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2022-07-14 06:43:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:52,115 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2022-07-14 06:43:52,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2022-07-14 06:43:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:43:52,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:52,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:52,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:43:52,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-14 06:43:52,317 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2022-07-14 06:43:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:52,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199758889] [2022-07-14 06:43:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:52,421 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 06:43:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199758889] [2022-07-14 06:43:52,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199758889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:52,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:52,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:43:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359235574] [2022-07-14 06:43:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:52,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:43:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:43:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:43:52,424 INFO L87 Difference]: Start difference. First operand 284 states and 339 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:52,731 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-07-14 06:43:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:43:52,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 06:43:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:52,733 INFO L225 Difference]: With dead ends: 348 [2022-07-14 06:43:52,733 INFO L226 Difference]: Without dead ends: 348 [2022-07-14 06:43:52,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:43:52,734 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 405 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:52,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 461 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-14 06:43:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2022-07-14 06:43:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:43:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2022-07-14 06:43:52,739 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2022-07-14 06:43:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:52,739 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2022-07-14 06:43:52,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2022-07-14 06:43:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:43:52,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:52,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 06:43:52,740 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2022-07-14 06:43:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070154455] [2022-07-14 06:43:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:52,867 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 06:43:52,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070154455] [2022-07-14 06:43:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070154455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:52,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:52,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:43:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699507910] [2022-07-14 06:43:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:52,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:43:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:52,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:43:52,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:43:52,869 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:53,236 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2022-07-14 06:43:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:43:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 06:43:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:53,238 INFO L225 Difference]: With dead ends: 348 [2022-07-14 06:43:53,238 INFO L226 Difference]: Without dead ends: 348 [2022-07-14 06:43:53,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:43:53,239 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 248 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:53,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 632 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:43:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-14 06:43:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2022-07-14 06:43:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 0 states have call successors, (0), 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 06:43:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2022-07-14 06:43:53,244 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2022-07-14 06:43:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:53,245 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2022-07-14 06:43:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2022-07-14 06:43:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:43:53,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:53,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:53,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-14 06:43:53,246 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2022-07-14 06:43:53,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:53,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101557244] [2022-07-14 06:43:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:43:53,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:53,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101557244] [2022-07-14 06:43:53,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101557244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:43:53,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306483846] [2022-07-14 06:43:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:53,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:43:53,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:43:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:53,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:43:53,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:43:53,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:43:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:43:53,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:43:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:43:53,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306483846] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:43:53,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:43:53,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-07-14 06:43:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284131877] [2022-07-14 06:43:53,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:43:53,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:53,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:53,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:53,523 INFO L87 Difference]: Start difference. First operand 297 states and 355 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:53,603 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2022-07-14 06:43:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:43:53,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 06:43:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:53,605 INFO L225 Difference]: With dead ends: 328 [2022-07-14 06:43:53,605 INFO L226 Difference]: Without dead ends: 304 [2022-07-14 06:43:53,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:53,606 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:53,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-07-14 06:43:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-14 06:43:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-07-14 06:43:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 0 states have call successors, (0), 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 06:43:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2022-07-14 06:43:53,611 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2022-07-14 06:43:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:53,611 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2022-07-14 06:43:53,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2022-07-14 06:43:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:43:53,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:53,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:53,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:43:53,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:53,813 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2022-07-14 06:43:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011672526] [2022-07-14 06:43:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:53,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011672526] [2022-07-14 06:43:53,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011672526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:53,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:53,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:43:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296704996] [2022-07-14 06:43:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:53,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:43:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:43:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:43:53,840 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 06:43:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:53,849 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2022-07-14 06:43:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:43:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-14 06:43:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:53,851 INFO L225 Difference]: With dead ends: 458 [2022-07-14 06:43:53,851 INFO L226 Difference]: Without dead ends: 458 [2022-07-14 06:43:53,851 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 06:43:53,852 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:53,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:43:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-14 06:43:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2022-07-14 06:43:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 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 06:43:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2022-07-14 06:43:53,859 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2022-07-14 06:43:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:53,859 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2022-07-14 06:43:53,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 06:43:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2022-07-14 06:43:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:43:53,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:53,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:53,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-14 06:43:53,860 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2022-07-14 06:43:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:53,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292406338] [2022-07-14 06:43:53,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:54,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:54,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292406338] [2022-07-14 06:43:54,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292406338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:54,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:54,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:43:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798871920] [2022-07-14 06:43:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:54,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:43:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:43:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:43:54,044 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 06:43:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:54,380 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2022-07-14 06:43:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:43:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-14 06:43:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:54,382 INFO L225 Difference]: With dead ends: 370 [2022-07-14 06:43:54,382 INFO L226 Difference]: Without dead ends: 370 [2022-07-14 06:43:54,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:43:54,383 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:54,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 514 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:43:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-14 06:43:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2022-07-14 06:43:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 0 states have call successors, (0), 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 06:43:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2022-07-14 06:43:54,389 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2022-07-14 06:43:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:54,389 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2022-07-14 06:43:54,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 06:43:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2022-07-14 06:43:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:43:54,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:54,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:54,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-14 06:43:54,391 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2022-07-14 06:43:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:54,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451950219] [2022-07-14 06:43:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:54,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451950219] [2022-07-14 06:43:54,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451950219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:54,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:54,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:43:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252801259] [2022-07-14 06:43:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:54,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:43:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:43:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:43:54,446 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:54,528 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2022-07-14 06:43:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:43:54,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-14 06:43:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:54,529 INFO L225 Difference]: With dead ends: 287 [2022-07-14 06:43:54,529 INFO L226 Difference]: Without dead ends: 287 [2022-07-14 06:43:54,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:43:54,530 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:54,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-14 06:43:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2022-07-14 06:43:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 0 states have call successors, (0), 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 06:43:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2022-07-14 06:43:54,535 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2022-07-14 06:43:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:54,535 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2022-07-14 06:43:54,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:43:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2022-07-14 06:43:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:43:54,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:54,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:54,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-14 06:43:54,536 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2022-07-14 06:43:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:54,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651783193] [2022-07-14 06:43:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:43:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:54,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651783193] [2022-07-14 06:43:54,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651783193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:54,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:54,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:43:54,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843278728] [2022-07-14 06:43:54,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:54,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:43:54,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:54,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:43:54,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:43:54,638 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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 06:43:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:55,008 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2022-07-14 06:43:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:43:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-14 06:43:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:55,010 INFO L225 Difference]: With dead ends: 279 [2022-07-14 06:43:55,010 INFO L226 Difference]: Without dead ends: 279 [2022-07-14 06:43:55,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:43:55,011 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 406 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:55,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 639 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:43:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-14 06:43:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-07-14 06:43:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 states have internal predecessors, (304), 0 states have call successors, (0), 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 06:43:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2022-07-14 06:43:55,015 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2022-07-14 06:43:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:55,016 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2022-07-14 06:43:55,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 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 06:43:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2022-07-14 06:43:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:43:55,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:55,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:55,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-14 06:43:55,017 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2022-07-14 06:43:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:55,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632739327] [2022-07-14 06:43:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:43:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632739327] [2022-07-14 06:43:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632739327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:43:55,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:43:55,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:43:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746134607] [2022-07-14 06:43:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:43:55,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:43:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:43:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:43:55,061 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 06:43:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:55,147 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2022-07-14 06:43:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:43:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 [2022-07-14 06:43:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:55,149 INFO L225 Difference]: With dead ends: 277 [2022-07-14 06:43:55,149 INFO L226 Difference]: Without dead ends: 277 [2022-07-14 06:43:55,149 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 06:43:55,150 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:55,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:43:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-14 06:43:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2022-07-14 06:43:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 0 states have call successors, (0), 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 06:43:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2022-07-14 06:43:55,154 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2022-07-14 06:43:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:55,155 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2022-07-14 06:43:55,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 06:43:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2022-07-14 06:43:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:43:55,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:55,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:55,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-14 06:43:55,156 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2022-07-14 06:43:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:55,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328412663] [2022-07-14 06:43:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:55,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328412663] [2022-07-14 06:43:55,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328412663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:43:55,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359207389] [2022-07-14 06:43:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:55,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:55,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:43:55,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:43:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:55,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 06:43:55,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:43:55,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:43:55,522 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:43:55,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:43:55,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:43:55,670 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:43:55,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:43:55,739 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:43:55,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:43:55,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:55,915 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 25 treesize of output 13 [2022-07-14 06:43:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:55,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:43:56,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:43:56,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 06:43:56,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:43:56,339 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 34 treesize of output 37 [2022-07-14 06:43:56,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 06:43:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:57,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359207389] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:43:57,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:43:57,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-14 06:43:57,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431527913] [2022-07-14 06:43:57,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:43:57,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 06:43:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:43:57,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 06:43:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=733, Unknown=8, NotChecked=0, Total=870 [2022-07-14 06:43:57,873 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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 06:43:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:43:58,499 INFO L93 Difference]: Finished difference Result 550 states and 621 transitions. [2022-07-14 06:43:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:43:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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 52 [2022-07-14 06:43:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:43:58,501 INFO L225 Difference]: With dead ends: 550 [2022-07-14 06:43:58,501 INFO L226 Difference]: Without dead ends: 550 [2022-07-14 06:43:58,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1144, Unknown=8, NotChecked=0, Total=1406 [2022-07-14 06:43:58,503 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 918 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 883 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:43:58,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1660 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1034 Invalid, 0 Unknown, 883 Unchecked, 0.5s Time] [2022-07-14 06:43:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-14 06:43:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 312. [2022-07-14 06:43:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 311 states have internal predecessors, (363), 0 states have call successors, (0), 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 06:43:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2022-07-14 06:43:58,509 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 52 [2022-07-14 06:43:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:43:58,509 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2022-07-14 06:43:58,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 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 06:43:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2022-07-14 06:43:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:43:58,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:43:58,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:43:58,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:43:58,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:58,727 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:43:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:43:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2022-07-14 06:43:58,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:43:58,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863531522] [2022-07-14 06:43:58,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:43:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:43:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863531522] [2022-07-14 06:43:58,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863531522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:43:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390237420] [2022-07-14 06:43:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:43:58,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:43:58,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:43:58,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:43:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:43:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:43:59,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 06:43:59,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:43:59,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:43:59,106 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:43:59,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:43:59,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:43:59,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:43:59,145 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 06:43:59,247 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:43:59,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:43:59,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:43:59,268 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:43:59,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-14 06:43:59,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:43:59,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:43:59,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:43:59,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:59,543 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 25 treesize of output 13 [2022-07-14 06:43:59,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:43:59,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:43:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:43:59,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:43:59,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (and (<= 0 (+ 4 .cse0)) (<= (+ 8 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))))) (not (<= 0 |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_73| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-14 06:44:00,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:00,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 06:44:00,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:00,401 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 34 treesize of output 37 [2022-07-14 06:44:00,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-14 06:44:00,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:00,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-14 06:44:00,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:00,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:44:00,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:00,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-14 06:44:00,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:00,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-14 06:44:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:00,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390237420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:00,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:44:00,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-07-14 06:44:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984946846] [2022-07-14 06:44:00,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:00,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:44:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:00,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:44:00,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=889, Unknown=9, NotChecked=60, Total=1056 [2022-07-14 06:44:00,849 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand has 33 states, 32 states have (on average 4.8125) internal successors, (154), 33 states have internal predecessors, (154), 0 states have call successors, (0), 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 06:44:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:08,345 INFO L93 Difference]: Finished difference Result 456 states and 506 transitions. [2022-07-14 06:44:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 06:44:08,347 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.8125) internal successors, (154), 33 states have internal predecessors, (154), 0 states have call successors, (0), 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 52 [2022-07-14 06:44:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:08,348 INFO L225 Difference]: With dead ends: 456 [2022-07-14 06:44:08,348 INFO L226 Difference]: Without dead ends: 456 [2022-07-14 06:44:08,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=456, Invalid=2961, Unknown=9, NotChecked=114, Total=3540 [2022-07-14 06:44:08,349 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 717 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:08,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1906 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1490 Invalid, 0 Unknown, 880 Unchecked, 0.7s Time] [2022-07-14 06:44:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-07-14 06:44:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2022-07-14 06:44:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.261437908496732) internal successors, (386), 328 states have internal predecessors, (386), 0 states have call successors, (0), 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 06:44:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 386 transitions. [2022-07-14 06:44:08,355 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 386 transitions. Word has length 52 [2022-07-14 06:44:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:08,356 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 386 transitions. [2022-07-14 06:44:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.8125) internal successors, (154), 33 states have internal predecessors, (154), 0 states have call successors, (0), 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 06:44:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 386 transitions. [2022-07-14 06:44:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 06:44:08,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:08,357 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:08,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 06:44:08,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:08,572 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:44:08,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2022-07-14 06:44:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:08,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666250847] [2022-07-14 06:44:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:08,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666250847] [2022-07-14 06:44:08,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666250847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:08,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079125752] [2022-07-14 06:44:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:08,901 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:44:08,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:44:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:09,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:44:09,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:09,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:44:09,061 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:44:09,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:44:09,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:09,140 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:09,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:44:09,195 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:09,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-14 06:44:09,313 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-14 06:44:09,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-14 06:44:09,369 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:44:09,369 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 1 case distinctions, treesize of input 43 treesize of output 36 [2022-07-14 06:44:09,701 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:09,702 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 1 case distinctions, treesize of input 54 treesize of output 48 [2022-07-14 06:44:10,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:10,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2022-07-14 06:44:11,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:11,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-07-14 06:44:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:14,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:14,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2022-07-14 06:44:15,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-07-14 06:44:15,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2022-07-14 06:44:16,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:16,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2022-07-14 06:44:16,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:16,242 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 546 treesize of output 524 [2022-07-14 06:44:16,249 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 596 treesize of output 564 [2022-07-14 06:44:16,262 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 548 treesize of output 508 [2022-07-14 06:44:16,272 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 528 treesize of output 484 [2022-07-14 06:44:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:16,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079125752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:16,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:44:16,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2022-07-14 06:44:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927925097] [2022-07-14 06:44:16,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:16,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 06:44:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:16,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 06:44:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1304, Unknown=43, NotChecked=234, Total=1806 [2022-07-14 06:44:16,617 INFO L87 Difference]: Start difference. First operand 329 states and 386 transitions. Second operand has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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 06:44:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:42,476 INFO L93 Difference]: Finished difference Result 622 states and 711 transitions. [2022-07-14 06:44:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 06:44:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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 55 [2022-07-14 06:44:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:42,478 INFO L225 Difference]: With dead ends: 622 [2022-07-14 06:44:42,478 INFO L226 Difference]: Without dead ends: 622 [2022-07-14 06:44:42,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=539, Invalid=3266, Unknown=113, NotChecked=372, Total=4290 [2022-07-14 06:44:42,479 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 595 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 4192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2772 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:42,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 3051 Invalid, 4192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1377 Invalid, 0 Unknown, 2772 Unchecked, 0.6s Time] [2022-07-14 06:44:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-07-14 06:44:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 361. [2022-07-14 06:44:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 360 states have internal predecessors, (421), 0 states have call successors, (0), 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 06:44:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 421 transitions. [2022-07-14 06:44:42,485 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 421 transitions. Word has length 55 [2022-07-14 06:44:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:42,486 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 421 transitions. [2022-07-14 06:44:42,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 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 06:44:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 421 transitions. [2022-07-14 06:44:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 06:44:42,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:42,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:42,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:44:42,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:42,701 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:44:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2022-07-14 06:44:42,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:42,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556722682] [2022-07-14 06:44:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:43,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556722682] [2022-07-14 06:44:43,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556722682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:43,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250181670] [2022-07-14 06:44:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:43,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:44:43,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:44:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:43,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-14 06:44:43,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:43,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:44:43,329 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:44:43,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:44:43,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:44:43,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:43,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:43,414 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:43,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-07-14 06:44:43,418 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 22 treesize of output 24 [2022-07-14 06:44:43,487 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:43,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-07-14 06:44:43,491 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 22 treesize of output 24 [2022-07-14 06:44:43,620 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:44:43,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:44:43,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:44:43,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:43,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-14 06:44:43,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:43,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:44:43,858 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:43,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2022-07-14 06:44:43,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:43,864 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 23 treesize of output 23 [2022-07-14 06:44:43,996 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:43,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-07-14 06:44:44,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-14 06:44:44,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:44,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 06:44:44,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:44,270 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:44,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-07-14 06:44:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:44,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:44,434 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) is different from false [2022-07-14 06:44:44,486 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2022-07-14 06:44:44,507 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-07-14 06:44:44,522 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))) is different from false [2022-07-14 06:44:44,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_85| Int) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (and (forall ((v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1344) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85| 0)) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_85| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-07-14 06:44:45,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_85| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_85| |c_ULTIMATE.start_main_~list~0#1.offset|)) (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85| 0))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1344 Int) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1342))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85| 0))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 8) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1344) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1343))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))))) is different from false [2022-07-14 06:44:46,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:46,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 175 [2022-07-14 06:44:46,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:46,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 115 [2022-07-14 06:44:46,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,332 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 624 treesize of output 594 [2022-07-14 06:44:46,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,346 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 2484 treesize of output 2450 [2022-07-14 06:44:46,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,359 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 2346 treesize of output 2218 [2022-07-14 06:44:46,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,373 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 2122 treesize of output 1994 [2022-07-14 06:44:46,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,404 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 1946 treesize of output 1882 [2022-07-14 06:44:46,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,417 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 1842 treesize of output 1774 [2022-07-14 06:44:46,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,435 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 1722 treesize of output 1546 [2022-07-14 06:44:46,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:46,444 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 1506 treesize of output 1326 [2022-07-14 06:44:47,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:47,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 83 [2022-07-14 06:44:47,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:47,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2022-07-14 06:44:47,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:47,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2022-07-14 06:44:47,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:47,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:47,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-14 06:44:47,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:47,566 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 18 treesize of output 10 [2022-07-14 06:44:47,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:44:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:47,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250181670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:44:47,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:44:47,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 42 [2022-07-14 06:44:47,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083761667] [2022-07-14 06:44:47,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:44:47,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 06:44:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:44:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 06:44:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1143, Unknown=20, NotChecked=450, Total=1806 [2022-07-14 06:44:47,710 INFO L87 Difference]: Start difference. First operand 361 states and 421 transitions. Second operand has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 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 06:44:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:44:53,314 INFO L93 Difference]: Finished difference Result 406 states and 460 transitions. [2022-07-14 06:44:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:44:53,314 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 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 55 [2022-07-14 06:44:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:44:53,316 INFO L225 Difference]: With dead ends: 406 [2022-07-14 06:44:53,316 INFO L226 Difference]: Without dead ends: 406 [2022-07-14 06:44:53,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=254, Invalid=1553, Unknown=23, NotChecked=522, Total=2352 [2022-07-14 06:44:53,317 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 182 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1421 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:44:53,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 2344 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1004 Invalid, 0 Unknown, 1421 Unchecked, 0.5s Time] [2022-07-14 06:44:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-07-14 06:44:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 360. [2022-07-14 06:44:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 338 states have (on average 1.227810650887574) internal successors, (415), 359 states have internal predecessors, (415), 0 states have call successors, (0), 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 06:44:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 415 transitions. [2022-07-14 06:44:53,322 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 415 transitions. Word has length 55 [2022-07-14 06:44:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:44:53,322 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 415 transitions. [2022-07-14 06:44:53,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 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 06:44:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 415 transitions. [2022-07-14 06:44:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 06:44:53,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:44:53,324 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:44:53,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-14 06:44:53,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:53,552 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:44:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:44:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2022-07-14 06:44:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:44:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031944851] [2022-07-14 06:44:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:44:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:44:53,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031944851] [2022-07-14 06:44:53,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031944851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:44:53,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128606288] [2022-07-14 06:44:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:44:53,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:44:53,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:44:53,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:44:53,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:44:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:44:54,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-14 06:44:54,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:44:54,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:44:54,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:54,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:44:54,247 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:44:54,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:44:54,311 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:44:54,312 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-14 06:44:54,326 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-14 06:44:54,326 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:44:54,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:54,500 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 23 treesize of output 23 [2022-07-14 06:44:54,508 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:44:54,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-07-14 06:44:54,710 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 06:44:54,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-14 06:44:54,795 INFO L356 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2022-07-14 06:44:54,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2022-07-14 06:44:54,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:44:54,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-14 06:44:55,000 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:44:55,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 75 [2022-07-14 06:44:55,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-14 06:44:55,193 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:44:55,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 82 [2022-07-14 06:44:55,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-14 06:44:55,751 INFO L356 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2022-07-14 06:44:55,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 39 [2022-07-14 06:44:55,757 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:44:55,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 06:44:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:44:55,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:44:56,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1466 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (or (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (= .cse1 0)) (= (select |c_#valid| .cse1) 1))))) is different from false [2022-07-14 06:44:56,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0))))) is different from false [2022-07-14 06:44:56,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1465) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-07-14 06:44:56,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse4 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse4) v_ArrVal_1464))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) .cse4) v_ArrVal_1466))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int))) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1465) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1467))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0))))) is different from false [2022-07-14 06:44:56,157 INFO L356 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-07-14 06:44:56,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2022-07-14 06:44:56,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse3 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3) v_ArrVal_1466))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) .cse1)) v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0))))) is different from false [2022-07-14 06:44:56,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:44:56,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 100 [2022-07-14 06:44:56,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (select v_arrayElimArr_10 .cse5))) (let ((.cse0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_10) .cse3 v_ArrVal_1464))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) .cse5) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse2 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (select v_arrayElimArr_10 .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1465) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_10) .cse1 v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1467))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (not (= (select |c_#valid| .cse3) 0))))))) is different from false [2022-07-14 06:44:56,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (select v_arrayElimArr_10 .cse5))) (let ((.cse0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_arrayElimArr_10) .cse1 v_ArrVal_1464))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_#t~mem11#1.base|) .cse5) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select |c_#valid| .cse1) 0)) (and (= .cse0 0) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse3 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_10 .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1462) .cse2 v_ArrVal_1465) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_arrayElimArr_10) .cse2 v_ArrVal_1464) |c_ULTIMATE.start_main_#t~mem11#1.base|) .cse3) v_ArrVal_1467))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)))))))) is different from false [2022-07-14 06:45:00,248 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-14 06:45:00,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2022-07-14 06:45:00,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:00,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:00,260 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:45:00,260 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 44 treesize of output 28 [2022-07-14 06:45:00,265 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 7 treesize of output 3 [2022-07-14 06:45:00,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:00,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:45:00,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2022-07-14 06:45:00,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:45:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:45:00,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128606288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:45:00,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:45:00,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 51 [2022-07-14 06:45:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614163093] [2022-07-14 06:45:00,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:45:00,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 06:45:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:45:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 06:45:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1685, Unknown=13, NotChecked=630, Total=2550 [2022-07-14 06:45:00,352 INFO L87 Difference]: Start difference. First operand 360 states and 415 transitions. Second operand has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 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 06:45:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:45:12,613 INFO L93 Difference]: Finished difference Result 413 states and 469 transitions. [2022-07-14 06:45:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:45:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 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 55 [2022-07-14 06:45:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:45:12,614 INFO L225 Difference]: With dead ends: 413 [2022-07-14 06:45:12,614 INFO L226 Difference]: Without dead ends: 413 [2022-07-14 06:45:12,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=413, Invalid=3247, Unknown=28, NotChecked=868, Total=4556 [2022-07-14 06:45:12,615 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 425 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1553 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:45:12,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1441 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 416 Invalid, 0 Unknown, 1553 Unchecked, 0.2s Time] [2022-07-14 06:45:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-14 06:45:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 383. [2022-07-14 06:45:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 361 states have (on average 1.2188365650969528) internal successors, (440), 382 states have internal predecessors, (440), 0 states have call successors, (0), 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 06:45:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 440 transitions. [2022-07-14 06:45:12,620 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 440 transitions. Word has length 55 [2022-07-14 06:45:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:45:12,620 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 440 transitions. [2022-07-14 06:45:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 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 06:45:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 440 transitions. [2022-07-14 06:45:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:45:12,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:45:12,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, 1, 1, 1, 1, 1, 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 06:45:12,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:45:12,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-14 06:45:12,843 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:45:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:45:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 320505786, now seen corresponding path program 1 times [2022-07-14 06:45:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:45:12,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462224810] [2022-07-14 06:45:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:45:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:45:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:45:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:45:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:45:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462224810] [2022-07-14 06:45:13,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462224810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:45:13,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:45:13,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 06:45:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109016739] [2022-07-14 06:45:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:45:13,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:45:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:45:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:45:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:45:13,029 INFO L87 Difference]: Start difference. First operand 383 states and 440 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 06:45:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:45:13,497 INFO L93 Difference]: Finished difference Result 407 states and 454 transitions. [2022-07-14 06:45:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:45:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-07-14 06:45:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:45:13,498 INFO L225 Difference]: With dead ends: 407 [2022-07-14 06:45:13,498 INFO L226 Difference]: Without dead ends: 407 [2022-07-14 06:45:13,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:45:13,499 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 256 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:45:13,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 742 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:45:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-07-14 06:45:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2022-07-14 06:45:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 361 states have (on average 1.2160664819944598) internal successors, (439), 382 states have internal predecessors, (439), 0 states have call successors, (0), 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 06:45:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 439 transitions. [2022-07-14 06:45:13,507 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 439 transitions. Word has length 56 [2022-07-14 06:45:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:45:13,508 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 439 transitions. [2022-07-14 06:45:13,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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 06:45:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 439 transitions. [2022-07-14 06:45:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 06:45:13,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:45:13,509 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:45:13,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-14 06:45:13,509 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2022-07-14 06:45:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:45:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1557310441, now seen corresponding path program 1 times [2022-07-14 06:45:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:45:13,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969500212] [2022-07-14 06:45:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:45:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:45:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:45:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:45:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:45:14,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969500212] [2022-07-14 06:45:14,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969500212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:45:14,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75346163] [2022-07-14 06:45:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:45:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:45:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:45:14,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:45:14,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:45:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:45:14,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-14 06:45:14,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:45:14,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:45:14,224 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:45:14,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:45:14,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:45:14,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:45:14,297 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:45:14,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:45:14,300 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 22 treesize of output 24 [2022-07-14 06:45:14,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:14,350 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:45:14,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 40 [2022-07-14 06:45:14,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2022-07-14 06:45:14,484 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:45:14,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:45:14,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:14,541 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:45:14,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 49 [2022-07-14 06:45:14,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:14,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-14 06:45:14,726 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:45:14,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 72 [2022-07-14 06:45:14,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:14,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2022-07-14 06:45:14,867 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-14 06:45:14,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 80 [2022-07-14 06:45:14,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2022-07-14 06:45:15,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:15,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:15,342 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-14 06:45:15,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2022-07-14 06:45:15,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:15,350 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:45:15,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-07-14 06:45:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:45:15,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:45:15,475 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1610)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 4))) 0))) is different from false [2022-07-14 06:45:15,507 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1610)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1611))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 4))) 0))) is different from false [2022-07-14 06:45:15,529 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1610)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1611) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 4)))) 0)) (forall ((v_ArrVal_1611 (Array Int Int)) (v_ArrVal_1610 (Array Int Int))) (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1611))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1610) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 4))) 0))) is different from false [2022-07-14 06:45:20,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:45:20,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 612 treesize of output 483 [2022-07-14 06:45:20,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:45:20,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 472 treesize of output 323 [2022-07-14 06:45:20,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:20,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:45:20,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3352 treesize of output 3206 [2022-07-14 06:45:20,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:20,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:20,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:20,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:21,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:22,065 INFO L356 Elim1Store]: treesize reduction 285, result has 53.3 percent of original size [2022-07-14 06:45:22,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 35 case distinctions, treesize of input 3402392 treesize of output 3205934 [2022-07-14 06:45:28,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:45:28,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:45:29,267 INFO L356 Elim1Store]: treesize reduction 59, result has 77.8 percent of original size [2022-07-14 06:45:29,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 3884237 treesize of output 3209015 [2022-07-14 06:47:18,665 WARN L233 SmtUtils]: Spent 1.82m on a formula simplification. DAG size of input: 5546 DAG size of output: 5528 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-14 06:47:23,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:47:23,485 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 2806115 treesize of output 2606583 [2022-07-14 06:47:54,099 WARN L233 SmtUtils]: Spent 30.61s on a formula simplification. DAG size of input: 5558 DAG size of output: 5554 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-14 06:47:54,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:47:54,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2487966 treesize of output 2341282