./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:45:19,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:45:19,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:45:20,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:45:20,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:45:20,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:45:20,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:45:20,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:45:20,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:45:20,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:45:20,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:45:20,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:45:20,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:45:20,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:45:20,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:45:20,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:45:20,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:45:20,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:45:20,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:45:20,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:45:20,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:45:20,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:45:20,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:45:20,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:45:20,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:45:20,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:45:20,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:45:20,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:45:20,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:45:20,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:45:20,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:45:20,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:45:20,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:45:20,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:45:20,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:45:20,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:45:20,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:45:20,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:45:20,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:45:20,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:45:20,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:45:20,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:45:20,074 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:45:20,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:45:20,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:45:20,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:45:20,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:45:20,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:45:20,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:45:20,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:45:20,080 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:45:20,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:45:20,081 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:45:20,081 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:45:20,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:45:20,083 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:45:20,083 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:45:20,083 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:45:20,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:45:20,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:45:20,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:45:20,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:20,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:45:20,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:45:20,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:45:20,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:45:20,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:45:20,084 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2021-12-14 19:45:20,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:45:20,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:45:20,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:45:20,297 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:45:20,301 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:45:20,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2021-12-14 19:45:20,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8fced20/dc5a0909c3524eefabfe014e2771bc39/FLAG1e1505dcc [2021-12-14 19:45:20,768 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:45:20,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2021-12-14 19:45:20,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8fced20/dc5a0909c3524eefabfe014e2771bc39/FLAG1e1505dcc [2021-12-14 19:45:21,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8fced20/dc5a0909c3524eefabfe014e2771bc39 [2021-12-14 19:45:21,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:45:21,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:45:21,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:21,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:45:21,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:45:21,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5f6e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21, skipping insertion in model container [2021-12-14 19:45:21,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:45:21,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:45:21,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2021-12-14 19:45:21,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2021-12-14 19:45:21,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2021-12-14 19:45:21,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2021-12-14 19:45:21,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2021-12-14 19:45:21,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2021-12-14 19:45:21,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2021-12-14 19:45:21,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2021-12-14 19:45:21,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2021-12-14 19:45:21,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2021-12-14 19:45:21,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2021-12-14 19:45:21,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2021-12-14 19:45:21,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2021-12-14 19:45:21,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:21,403 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:45:21,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2021-12-14 19:45:21,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2021-12-14 19:45:21,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2021-12-14 19:45:21,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2021-12-14 19:45:21,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2021-12-14 19:45:21,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2021-12-14 19:45:21,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2021-12-14 19:45:21,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2021-12-14 19:45:21,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2021-12-14 19:45:21,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2021-12-14 19:45:21,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2021-12-14 19:45:21,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2021-12-14 19:45:21,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2021-12-14 19:45:21,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:45:21,464 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:45:21,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21 WrapperNode [2021-12-14 19:45:21,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:45:21,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:21,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:45:21,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:45:21,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,524 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2021-12-14 19:45:21,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:45:21,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:45:21,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:45:21,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:45:21,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:45:21,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:45:21,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:45:21,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:45:21,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (1/1) ... [2021-12-14 19:45:21,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:45:21,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:21,586 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) [2021-12-14 19:45:21,588 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 [2021-12-14 19:45:21,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:45:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:45:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:45:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:45:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:45:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:45:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:45:21,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:45:21,731 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:45:21,732 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:45:22,083 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:45:22,090 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:45:22,090 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-14 19:45:22,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:22 BoogieIcfgContainer [2021-12-14 19:45:22,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:45:22,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:45:22,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:45:22,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:45:22,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:45:21" (1/3) ... [2021-12-14 19:45:22,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fec6083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:22, skipping insertion in model container [2021-12-14 19:45:22,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:45:21" (2/3) ... [2021-12-14 19:45:22,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fec6083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:45:22, skipping insertion in model container [2021-12-14 19:45:22,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:45:22" (3/3) ... [2021-12-14 19:45:22,099 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2021-12-14 19:45:22,104 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:45:22,105 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2021-12-14 19:45:22,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:45:22,142 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:45:22,142 INFO L340 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2021-12-14 19:45:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:22,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:22,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:22,176 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:45:22,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:22,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170629950] [2021-12-14 19:45:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:22,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:22,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:22,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170629950] [2021-12-14 19:45:22,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170629950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:22,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:22,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:22,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816135153] [2021-12-14 19:45:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:22,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:22,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:22,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:22,376 INFO L87 Difference]: Start difference. First operand has 203 states, 116 states have (on average 2.1982758620689653) internal successors, (255), 202 states have internal predecessors, (255), 0 states have call successors, (0), 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) [2021-12-14 19:45:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:22,535 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-12-14 19:45:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:22,537 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 [2021-12-14 19:45:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:22,547 INFO L225 Difference]: With dead ends: 201 [2021-12-14 19:45:22,548 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 19:45:22,549 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:22,552 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:22,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 19:45:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2021-12-14 19:45:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 192 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 204 transitions. [2021-12-14 19:45:22,590 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 204 transitions. Word has length 3 [2021-12-14 19:45:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:22,591 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 204 transitions. [2021-12-14 19:45:22,591 INFO L471 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) [2021-12-14 19:45:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 204 transitions. [2021-12-14 19:45:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:45:22,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:22,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:45:22,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:45:22,593 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:45:22,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569584132] [2021-12-14 19:45:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:22,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:22,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569584132] [2021-12-14 19:45:22,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569584132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:22,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:22,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:22,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186748585] [2021-12-14 19:45:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:22,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:22,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:22,637 INFO L87 Difference]: Start difference. First operand 193 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:22,753 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2021-12-14 19:45:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:22,754 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 [2021-12-14 19:45:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:22,757 INFO L225 Difference]: With dead ends: 222 [2021-12-14 19:45:22,762 INFO L226 Difference]: Without dead ends: 222 [2021-12-14 19:45:22,762 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:22,764 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 181 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:22,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-14 19:45:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-12-14 19:45:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.671641791044776) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-12-14 19:45:22,784 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 3 [2021-12-14 19:45:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:22,784 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-12-14 19:45:22,784 INFO L471 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) [2021-12-14 19:45:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-12-14 19:45:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:45:22,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:22,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:45:22,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:45:22,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2021-12-14 19:45:22,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507553458] [2021-12-14 19:45:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:22,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:22,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507553458] [2021-12-14 19:45:22,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507553458] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:22,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:22,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:22,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314404475] [2021-12-14 19:45:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:22,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:22,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:22,828 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:22,855 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2021-12-14 19:45:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:22,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:45:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:22,856 INFO L225 Difference]: With dead ends: 217 [2021-12-14 19:45:22,856 INFO L226 Difference]: Without dead ends: 217 [2021-12-14 19:45:22,857 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:22,857 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 177 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:22,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 204 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-14 19:45:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-12-14 19:45:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 199 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2021-12-14 19:45:22,863 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 6 [2021-12-14 19:45:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:22,863 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2021-12-14 19:45:22,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2021-12-14 19:45:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:45:22,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:22,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:22,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:45:22,864 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:22,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2021-12-14 19:45:22,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:22,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773332266] [2021-12-14 19:45:22,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:22,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:22,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:22,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773332266] [2021-12-14 19:45:22,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773332266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:22,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:22,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:22,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926379901] [2021-12-14 19:45:22,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:22,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:22,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:22,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:22,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:22,941 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:23,123 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-12-14 19:45:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 19:45:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:23,124 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:45:23,124 INFO L226 Difference]: Without dead ends: 199 [2021-12-14 19:45:23,124 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:23,125 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:23,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 539 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-14 19:45:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-14 19:45:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2021-12-14 19:45:23,141 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 12 [2021-12-14 19:45:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:23,141 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2021-12-14 19:45:23,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2021-12-14 19:45:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:45:23,141 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:23,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:23,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:45:23,142 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2021-12-14 19:45:23,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:23,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068958667] [2021-12-14 19:45:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:23,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:23,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:23,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068958667] [2021-12-14 19:45:23,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068958667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:23,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:23,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:23,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877304879] [2021-12-14 19:45:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:23,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:23,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:23,249 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:23,419 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-14 19:45:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 19:45:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:23,420 INFO L225 Difference]: With dead ends: 198 [2021-12-14 19:45:23,420 INFO L226 Difference]: Without dead ends: 198 [2021-12-14 19:45:23,421 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:23,421 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:23,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 548 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-14 19:45:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-14 19:45:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 197 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) [2021-12-14 19:45:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-14 19:45:23,426 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 12 [2021-12-14 19:45:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:23,426 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-14 19:45:23,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-14 19:45:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:45:23,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:23,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:23,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:45:23,427 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2021-12-14 19:45:23,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:23,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294282775] [2021-12-14 19:45:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:23,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:23,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:23,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294282775] [2021-12-14 19:45:23,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294282775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:23,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:23,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:23,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260578894] [2021-12-14 19:45:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:23,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:23,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:23,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:23,453 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:23,459 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2021-12-14 19:45:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:23,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 19:45:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:23,460 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:45:23,460 INFO L226 Difference]: Without dead ends: 199 [2021-12-14 19:45:23,460 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:23,461 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 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 [2021-12-14 19:45:23,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-14 19:45:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-14 19:45:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 198 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2021-12-14 19:45:23,465 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 14 [2021-12-14 19:45:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:23,465 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2021-12-14 19:45:23,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2021-12-14 19:45:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:23,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:23,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:23,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:45:23,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2021-12-14 19:45:23,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:23,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217455974] [2021-12-14 19:45:23,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:23,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:23,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:23,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217455974] [2021-12-14 19:45:23,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217455974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:23,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:23,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:45:23,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114257966] [2021-12-14 19:45:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:23,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:45:23,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:45:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:23,539 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:23,732 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-14 19:45:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:45:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 19:45:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:23,733 INFO L225 Difference]: With dead ends: 198 [2021-12-14 19:45:23,733 INFO L226 Difference]: Without dead ends: 198 [2021-12-14 19:45:23,734 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:23,734 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 175 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:23,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 456 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-14 19:45:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-14 19:45:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 197 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) [2021-12-14 19:45:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-14 19:45:23,738 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 15 [2021-12-14 19:45:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:23,738 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-14 19:45:23,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-14 19:45:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:45:23,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:23,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:23,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:45:23,739 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2021-12-14 19:45:23,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339499469] [2021-12-14 19:45:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:23,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:23,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:23,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339499469] [2021-12-14 19:45:23,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339499469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:23,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:23,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:45:23,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151311225] [2021-12-14 19:45:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:23,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:45:23,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:45:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:23,821 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:24,115 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-12-14 19:45:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:45:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 19:45:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:24,116 INFO L225 Difference]: With dead ends: 197 [2021-12-14 19:45:24,116 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 19:45:24,117 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:24,117 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 169 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:24,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 577 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 19:45:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-14 19:45:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-12-14 19:45:24,120 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 15 [2021-12-14 19:45:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:24,120 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-12-14 19:45:24,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-12-14 19:45:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:45:24,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:24,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:24,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:45:24,121 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2021-12-14 19:45:24,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956411957] [2021-12-14 19:45:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:24,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:24,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:24,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956411957] [2021-12-14 19:45:24,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956411957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:24,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:24,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:45:24,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335877762] [2021-12-14 19:45:24,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:24,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:45:24,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:24,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:45:24,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:24,177 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:24,343 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2021-12-14 19:45:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:45:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:24,344 INFO L225 Difference]: With dead ends: 289 [2021-12-14 19:45:24,344 INFO L226 Difference]: Without dead ends: 289 [2021-12-14 19:45:24,344 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:24,345 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:24,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 651 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-14 19:45:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-12-14 19:45:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.628787878787879) internal successors, (215), 193 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) [2021-12-14 19:45:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-12-14 19:45:24,349 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2021-12-14 19:45:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:24,349 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-12-14 19:45:24,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-12-14 19:45:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:45:24,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:24,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:24,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:45:24,350 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2021-12-14 19:45:24,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:24,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621292248] [2021-12-14 19:45:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:24,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:24,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:24,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621292248] [2021-12-14 19:45:24,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621292248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:24,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:24,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:24,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062808090] [2021-12-14 19:45:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:24,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:24,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:24,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:24,384 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:24,497 INFO L93 Difference]: Finished difference Result 290 states and 316 transitions. [2021-12-14 19:45:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 19:45:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:24,499 INFO L225 Difference]: With dead ends: 290 [2021-12-14 19:45:24,499 INFO L226 Difference]: Without dead ends: 290 [2021-12-14 19:45:24,499 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:24,500 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:24,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-14 19:45:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-12-14 19:45:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.614814814814815) internal successors, (218), 196 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2021-12-14 19:45:24,503 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 18 [2021-12-14 19:45:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:24,504 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2021-12-14 19:45:24,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2021-12-14 19:45:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:45:24,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:24,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:24,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:45:24,505 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2021-12-14 19:45:24,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:24,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215935760] [2021-12-14 19:45:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:24,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:24,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:24,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215935760] [2021-12-14 19:45:24,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215935760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:24,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:24,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:24,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793649983] [2021-12-14 19:45:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:24,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:24,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:24,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:24,531 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:24,631 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-14 19:45:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:24,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 19:45:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:24,632 INFO L225 Difference]: With dead ends: 191 [2021-12-14 19:45:24,632 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 19:45:24,632 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:24,633 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 257 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:24,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 118 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 19:45:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2021-12-14 19:45:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 186 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2021-12-14 19:45:24,636 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 20 [2021-12-14 19:45:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:24,636 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2021-12-14 19:45:24,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2021-12-14 19:45:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:45:24,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:24,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:24,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:45:24,637 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2021-12-14 19:45:24,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:24,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980386836] [2021-12-14 19:45:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:24,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:24,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980386836] [2021-12-14 19:45:24,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980386836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:24,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:24,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:24,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738903233] [2021-12-14 19:45:24,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:24,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:24,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:24,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:24,690 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:24,868 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2021-12-14 19:45:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:45:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-14 19:45:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:24,870 INFO L225 Difference]: With dead ends: 248 [2021-12-14 19:45:24,870 INFO L226 Difference]: Without dead ends: 248 [2021-12-14 19:45:24,870 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:24,870 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 449 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:24,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 255 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-14 19:45:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2021-12-14 19:45:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 210 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2021-12-14 19:45:24,873 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 20 [2021-12-14 19:45:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:24,873 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2021-12-14 19:45:24,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2021-12-14 19:45:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:45:24,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:24,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:24,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:45:24,874 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:24,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2021-12-14 19:45:24,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:24,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230202281] [2021-12-14 19:45:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:24,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:24,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:24,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230202281] [2021-12-14 19:45:24,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230202281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:24,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:24,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:24,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358766351] [2021-12-14 19:45:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:24,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:45:24,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:45:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:45:24,899 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:24,978 INFO L93 Difference]: Finished difference Result 243 states and 256 transitions. [2021-12-14 19:45:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:45:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:24,979 INFO L225 Difference]: With dead ends: 243 [2021-12-14 19:45:24,979 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 19:45:24,980 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:24,980 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 234 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:24,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 273 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 19:45:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2021-12-14 19:45:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 208 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2021-12-14 19:45:24,983 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 22 [2021-12-14 19:45:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:24,984 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2021-12-14 19:45:24,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2021-12-14 19:45:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:45:24,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:24,985 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:24,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:45:24,985 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2021-12-14 19:45:24,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:24,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56849698] [2021-12-14 19:45:24,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:24,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:25,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:25,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56849698] [2021-12-14 19:45:25,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56849698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:25,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:25,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:25,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260105148] [2021-12-14 19:45:25,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:25,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:25,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:25,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:25,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:25,013 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:25,123 INFO L93 Difference]: Finished difference Result 208 states and 241 transitions. [2021-12-14 19:45:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:45:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:25,124 INFO L225 Difference]: With dead ends: 208 [2021-12-14 19:45:25,124 INFO L226 Difference]: Without dead ends: 208 [2021-12-14 19:45:25,124 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:25,125 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 9 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:25,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 469 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-14 19:45:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-12-14 19:45:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.50625) internal successors, (241), 207 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2021-12-14 19:45:25,128 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 23 [2021-12-14 19:45:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:25,128 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2021-12-14 19:45:25,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2021-12-14 19:45:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:45:25,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:25,129 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:25,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:45:25,129 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2021-12-14 19:45:25,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:25,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544073293] [2021-12-14 19:45:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:25,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:25,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:25,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544073293] [2021-12-14 19:45:25,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544073293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:25,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:25,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:25,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484427398] [2021-12-14 19:45:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:25,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:25,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:25,172 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:25,296 INFO L93 Difference]: Finished difference Result 207 states and 239 transitions. [2021-12-14 19:45:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:25,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:45:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:25,297 INFO L225 Difference]: With dead ends: 207 [2021-12-14 19:45:25,297 INFO L226 Difference]: Without dead ends: 207 [2021-12-14 19:45:25,297 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:25,298 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:25,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 458 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-14 19:45:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-12-14 19:45:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.49375) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2021-12-14 19:45:25,301 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 23 [2021-12-14 19:45:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:25,301 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2021-12-14 19:45:25,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2021-12-14 19:45:25,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:45:25,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:25,301 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:25,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:45:25,301 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2021-12-14 19:45:25,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:25,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224217047] [2021-12-14 19:45:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:25,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:25,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:25,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224217047] [2021-12-14 19:45:25,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224217047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:25,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:25,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:25,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28015045] [2021-12-14 19:45:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:25,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:25,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:25,367 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:25,626 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2021-12-14 19:45:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:45:25,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:45:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:25,627 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:45:25,627 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:45:25,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:45:25,628 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 250 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:25,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 434 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:45:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-12-14 19:45:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.4875) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2021-12-14 19:45:25,630 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 27 [2021-12-14 19:45:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:25,631 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2021-12-14 19:45:25,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2021-12-14 19:45:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:45:25,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:25,631 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:25,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:45:25,631 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2021-12-14 19:45:25,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:25,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726496334] [2021-12-14 19:45:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:25,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:25,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726496334] [2021-12-14 19:45:25,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726496334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:25,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:25,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:45:25,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826244315] [2021-12-14 19:45:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:25,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:45:25,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:45:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:45:25,787 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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) [2021-12-14 19:45:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:26,323 INFO L93 Difference]: Finished difference Result 281 states and 297 transitions. [2021-12-14 19:45:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:45:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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 [2021-12-14 19:45:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:26,324 INFO L225 Difference]: With dead ends: 281 [2021-12-14 19:45:26,324 INFO L226 Difference]: Without dead ends: 281 [2021-12-14 19:45:26,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:45:26,325 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 325 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:26,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 672 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:45:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-14 19:45:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 238. [2021-12-14 19:45:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 192 states have (on average 1.4583333333333333) internal successors, (280), 237 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 280 transitions. [2021-12-14 19:45:26,329 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 280 transitions. Word has length 27 [2021-12-14 19:45:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:26,330 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 280 transitions. [2021-12-14 19:45:26,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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) [2021-12-14 19:45:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 280 transitions. [2021-12-14 19:45:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:45:26,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:26,330 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:26,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:45:26,330 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:26,331 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2021-12-14 19:45:26,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:26,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690501466] [2021-12-14 19:45:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:26,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:26,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:26,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690501466] [2021-12-14 19:45:26,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690501466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:26,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:26,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:26,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100329197] [2021-12-14 19:45:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:26,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:26,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:26,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:26,370 INFO L87 Difference]: Start difference. First operand 238 states and 280 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) [2021-12-14 19:45:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:26,376 INFO L93 Difference]: Finished difference Result 312 states and 368 transitions. [2021-12-14 19:45:26,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:26,376 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 [2021-12-14 19:45:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:26,377 INFO L225 Difference]: With dead ends: 312 [2021-12-14 19:45:26,377 INFO L226 Difference]: Without dead ends: 312 [2021-12-14 19:45:26,377 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:26,377 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 52 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 323 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 [2021-12-14 19:45:26,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 323 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-14 19:45:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 244. [2021-12-14 19:45:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 198 states have (on average 1.4545454545454546) internal successors, (288), 243 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 288 transitions. [2021-12-14 19:45:26,381 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 288 transitions. Word has length 28 [2021-12-14 19:45:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:26,381 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 288 transitions. [2021-12-14 19:45:26,381 INFO L471 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) [2021-12-14 19:45:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 288 transitions. [2021-12-14 19:45:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:45:26,381 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:26,381 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:26,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:45:26,381 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2021-12-14 19:45:26,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:26,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582959524] [2021-12-14 19:45:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:26,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:26,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:26,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582959524] [2021-12-14 19:45:26,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582959524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:26,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:26,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:26,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35183905] [2021-12-14 19:45:26,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:26,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:26,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:26,445 INFO L87 Difference]: Start difference. First operand 244 states and 288 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:26,557 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2021-12-14 19:45:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:26,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 19:45:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:26,558 INFO L225 Difference]: With dead ends: 246 [2021-12-14 19:45:26,558 INFO L226 Difference]: Without dead ends: 246 [2021-12-14 19:45:26,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:26,558 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 255 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:26,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 234 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-14 19:45:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2021-12-14 19:45:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4387755102040816) internal successors, (282), 239 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 282 transitions. [2021-12-14 19:45:26,561 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 282 transitions. Word has length 29 [2021-12-14 19:45:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:26,561 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 282 transitions. [2021-12-14 19:45:26,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 282 transitions. [2021-12-14 19:45:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:45:26,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:26,563 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:26,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:45:26,563 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:26,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2021-12-14 19:45:26,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:26,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962195379] [2021-12-14 19:45:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:26,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:26,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:26,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962195379] [2021-12-14 19:45:26,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962195379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:26,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:26,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:26,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451155646] [2021-12-14 19:45:26,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:26,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:26,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:26,596 INFO L87 Difference]: Start difference. First operand 240 states and 282 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:26,605 INFO L93 Difference]: Finished difference Result 238 states and 279 transitions. [2021-12-14 19:45:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 19:45:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:26,606 INFO L225 Difference]: With dead ends: 238 [2021-12-14 19:45:26,606 INFO L226 Difference]: Without dead ends: 238 [2021-12-14 19:45:26,606 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:26,607 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 20 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 286 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 [2021-12-14 19:45:26,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 286 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-14 19:45:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-12-14 19:45:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 195 states have (on average 1.4307692307692308) internal successors, (279), 237 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 279 transitions. [2021-12-14 19:45:26,612 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 279 transitions. Word has length 29 [2021-12-14 19:45:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:26,612 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 279 transitions. [2021-12-14 19:45:26,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 279 transitions. [2021-12-14 19:45:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:45:26,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:26,613 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:26,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:45:26,613 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2021-12-14 19:45:26,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246171058] [2021-12-14 19:45:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:26,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:26,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:26,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246171058] [2021-12-14 19:45:26,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246171058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:26,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:26,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:45:26,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394882904] [2021-12-14 19:45:26,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:26,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:26,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:26,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:26,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:26,715 INFO L87 Difference]: Start difference. First operand 238 states and 279 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:27,020 INFO L93 Difference]: Finished difference Result 341 states and 379 transitions. [2021-12-14 19:45:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:45:27,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 19:45:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:27,021 INFO L225 Difference]: With dead ends: 341 [2021-12-14 19:45:27,022 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 19:45:27,022 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:27,023 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 379 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:27,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 869 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 19:45:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 250. [2021-12-14 19:45:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 249 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 292 transitions. [2021-12-14 19:45:27,035 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 292 transitions. Word has length 30 [2021-12-14 19:45:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:27,035 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 292 transitions. [2021-12-14 19:45:27,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 292 transitions. [2021-12-14 19:45:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:45:27,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:27,036 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:27,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:45:27,036 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2021-12-14 19:45:27,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:27,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674615957] [2021-12-14 19:45:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:27,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674615957] [2021-12-14 19:45:27,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674615957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:27,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24288939] [2021-12-14 19:45:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:27,139 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:27,156 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) [2021-12-14 19:45:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:45:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:27,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:45:27,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:27,320 INFO L388 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 [2021-12-14 19:45:27,324 INFO L388 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 [2021-12-14 19:45:27,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:27,348 INFO L388 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 [2021-12-14 19:45:27,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:27,353 INFO L388 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 [2021-12-14 19:45:27,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:27,388 INFO L388 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 [2021-12-14 19:45:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:27,393 INFO L388 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 [2021-12-14 19:45:27,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:45:27,545 INFO L388 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 [2021-12-14 19:45:27,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:45:27,550 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:45:27,551 INFO L388 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 [2021-12-14 19:45:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:27,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:28,150 INFO L388 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 21 treesize of output 19 [2021-12-14 19:45:28,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-14 19:45:28,157 INFO L388 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 23 treesize of output 21 [2021-12-14 19:45:28,167 INFO L388 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 22 treesize of output 20 [2021-12-14 19:45:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:28,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24288939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:28,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:45:28,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-14 19:45:28,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146683165] [2021-12-14 19:45:28,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:45:28,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:45:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:45:28,183 INFO L87 Difference]: Start difference. First operand 250 states and 292 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:28,483 INFO L93 Difference]: Finished difference Result 341 states and 378 transitions. [2021-12-14 19:45:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 19:45:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:28,484 INFO L225 Difference]: With dead ends: 341 [2021-12-14 19:45:28,484 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 19:45:28,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:45:28,484 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 475 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:28,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 796 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 439 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2021-12-14 19:45:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 19:45:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 276. [2021-12-14 19:45:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 233 states have (on average 1.4163090128755365) internal successors, (330), 275 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-12-14 19:45:28,488 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 32 [2021-12-14 19:45:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:28,488 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-12-14 19:45:28,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-12-14 19:45:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:45:28,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:28,488 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:28,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:45:28,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 19:45:28,689 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2021-12-14 19:45:28,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:28,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53782116] [2021-12-14 19:45:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:28,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:28,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:28,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53782116] [2021-12-14 19:45:28,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53782116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:28,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:28,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:45:28,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373229243] [2021-12-14 19:45:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:28,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:45:28,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:28,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:45:28,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:45:28,784 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:29,210 INFO L93 Difference]: Finished difference Result 382 states and 428 transitions. [2021-12-14 19:45:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:45:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 19:45:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:29,211 INFO L225 Difference]: With dead ends: 382 [2021-12-14 19:45:29,212 INFO L226 Difference]: Without dead ends: 382 [2021-12-14 19:45:29,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:45:29,212 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 397 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:29,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 994 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-14 19:45:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 277. [2021-12-14 19:45:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 236 states have (on average 1.3898305084745763) internal successors, (328), 276 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 328 transitions. [2021-12-14 19:45:29,216 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 328 transitions. Word has length 35 [2021-12-14 19:45:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:29,216 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 328 transitions. [2021-12-14 19:45:29,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 328 transitions. [2021-12-14 19:45:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:45:29,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:29,216 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:29,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:45:29,216 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:29,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2021-12-14 19:45:29,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:29,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258332003] [2021-12-14 19:45:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:29,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:29,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258332003] [2021-12-14 19:45:29,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258332003] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:29,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:29,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:45:29,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864411576] [2021-12-14 19:45:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:29,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:45:29,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:45:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:45:29,393 INFO L87 Difference]: Start difference. First operand 277 states and 328 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:30,003 INFO L93 Difference]: Finished difference Result 456 states and 494 transitions. [2021-12-14 19:45:30,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:45:30,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 19:45:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:30,005 INFO L225 Difference]: With dead ends: 456 [2021-12-14 19:45:30,005 INFO L226 Difference]: Without dead ends: 456 [2021-12-14 19:45:30,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2021-12-14 19:45:30,006 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 763 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:30,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 938 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:45:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-12-14 19:45:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 283. [2021-12-14 19:45:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 242 states have (on average 1.384297520661157) internal successors, (335), 282 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 335 transitions. [2021-12-14 19:45:30,010 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 335 transitions. Word has length 35 [2021-12-14 19:45:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:30,010 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 335 transitions. [2021-12-14 19:45:30,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 335 transitions. [2021-12-14 19:45:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:45:30,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:30,011 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:30,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:45:30,012 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2021-12-14 19:45:30,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:30,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363728781] [2021-12-14 19:45:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:30,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:30,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:30,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363728781] [2021-12-14 19:45:30,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363728781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:30,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:30,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 19:45:30,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848009641] [2021-12-14 19:45:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:30,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:45:30,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:45:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:45:30,225 INFO L87 Difference]: Start difference. First operand 283 states and 335 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,076 INFO L93 Difference]: Finished difference Result 398 states and 439 transitions. [2021-12-14 19:45:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-14 19:45:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:45:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,079 INFO L225 Difference]: With dead ends: 398 [2021-12-14 19:45:31,079 INFO L226 Difference]: Without dead ends: 398 [2021-12-14 19:45:31,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 19:45:31,080 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 730 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:31,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 1056 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:45:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-14 19:45:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 283. [2021-12-14 19:45:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 242 states have (on average 1.3801652892561984) internal successors, (334), 282 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 334 transitions. [2021-12-14 19:45:31,085 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 334 transitions. Word has length 37 [2021-12-14 19:45:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,086 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 334 transitions. [2021-12-14 19:45:31,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 334 transitions. [2021-12-14 19:45:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:45:31,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,086 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:31,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:45:31,087 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2021-12-14 19:45:31,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397349114] [2021-12-14 19:45:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:31,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397349114] [2021-12-14 19:45:31,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397349114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:31,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975160809] [2021-12-14 19:45:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:31,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:31,118 INFO L87 Difference]: Start difference. First operand 283 states and 334 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,221 INFO L93 Difference]: Finished difference Result 282 states and 332 transitions. [2021-12-14 19:45:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:31,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:45:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,222 INFO L225 Difference]: With dead ends: 282 [2021-12-14 19:45:31,222 INFO L226 Difference]: Without dead ends: 282 [2021-12-14 19:45:31,222 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:31,223 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 6 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:31,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 444 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-14 19:45:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-12-14 19:45:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 242 states have (on average 1.371900826446281) internal successors, (332), 281 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 332 transitions. [2021-12-14 19:45:31,226 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 332 transitions. Word has length 37 [2021-12-14 19:45:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,226 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 332 transitions. [2021-12-14 19:45:31,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 332 transitions. [2021-12-14 19:45:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:45:31,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,226 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:31,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 19:45:31,227 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2021-12-14 19:45:31,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993006586] [2021-12-14 19:45:31,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:31,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993006586] [2021-12-14 19:45:31,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993006586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:45:31,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842463620] [2021-12-14 19:45:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:31,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:31,266 INFO L87 Difference]: Start difference. First operand 282 states and 332 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,384 INFO L93 Difference]: Finished difference Result 281 states and 330 transitions. [2021-12-14 19:45:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:45:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:45:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,385 INFO L225 Difference]: With dead ends: 281 [2021-12-14 19:45:31,385 INFO L226 Difference]: Without dead ends: 281 [2021-12-14 19:45:31,386 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:31,386 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:31,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 420 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-14 19:45:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-12-14 19:45:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 242 states have (on average 1.3636363636363635) internal successors, (330), 280 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 330 transitions. [2021-12-14 19:45:31,389 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 330 transitions. Word has length 37 [2021-12-14 19:45:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,389 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 330 transitions. [2021-12-14 19:45:31,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 330 transitions. [2021-12-14 19:45:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:45:31,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,390 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:31,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 19:45:31,390 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2021-12-14 19:45:31,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925154555] [2021-12-14 19:45:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:31,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925154555] [2021-12-14 19:45:31,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925154555] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:45:31,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808436667] [2021-12-14 19:45:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:45:31,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:45:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:31,450 INFO L87 Difference]: Start difference. First operand 281 states and 330 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) [2021-12-14 19:45:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,615 INFO L93 Difference]: Finished difference Result 304 states and 353 transitions. [2021-12-14 19:45:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:45:31,616 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 [2021-12-14 19:45:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,617 INFO L225 Difference]: With dead ends: 304 [2021-12-14 19:45:31,617 INFO L226 Difference]: Without dead ends: 304 [2021-12-14 19:45:31,617 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:31,617 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 52 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:31,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 678 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-14 19:45:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 290. [2021-12-14 19:45:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 251 states have (on average 1.350597609561753) internal successors, (339), 289 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) [2021-12-14 19:45:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 339 transitions. [2021-12-14 19:45:31,628 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 339 transitions. Word has length 37 [2021-12-14 19:45:31,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,628 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 339 transitions. [2021-12-14 19:45:31,628 INFO L471 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) [2021-12-14 19:45:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 339 transitions. [2021-12-14 19:45:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:45:31,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,629 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:31,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 19:45:31,629 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2021-12-14 19:45:31,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045225758] [2021-12-14 19:45:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:31,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045225758] [2021-12-14 19:45:31,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045225758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:31,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053476524] [2021-12-14 19:45:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:31,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:31,669 INFO L87 Difference]: Start difference. First operand 290 states and 339 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,674 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2021-12-14 19:45:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:31,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 19:45:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,675 INFO L225 Difference]: With dead ends: 292 [2021-12-14 19:45:31,675 INFO L226 Difference]: Without dead ends: 292 [2021-12-14 19:45:31,675 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:31,676 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 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 [2021-12-14 19:45:31,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-14 19:45:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-12-14 19:45:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 253 states have (on average 1.3478260869565217) internal successors, (341), 291 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2021-12-14 19:45:31,679 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 39 [2021-12-14 19:45:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,679 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2021-12-14 19:45:31,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2021-12-14 19:45:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:45:31,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,680 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:31,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 19:45:31,680 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash -404838824, now seen corresponding path program 1 times [2021-12-14 19:45:31,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312077662] [2021-12-14 19:45:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:31,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312077662] [2021-12-14 19:45:31,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312077662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:45:31,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968288716] [2021-12-14 19:45:31,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:31,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:31,723 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:31,766 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2021-12-14 19:45:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 19:45:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:31,767 INFO L225 Difference]: With dead ends: 305 [2021-12-14 19:45:31,767 INFO L226 Difference]: Without dead ends: 305 [2021-12-14 19:45:31,767 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:31,768 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 109 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:31,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 162 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-12-14 19:45:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 293. [2021-12-14 19:45:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 254 states have (on average 1.3464566929133859) internal successors, (342), 292 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 342 transitions. [2021-12-14 19:45:31,771 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 342 transitions. Word has length 39 [2021-12-14 19:45:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:31,771 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 342 transitions. [2021-12-14 19:45:31,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 342 transitions. [2021-12-14 19:45:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:45:31,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:31,772 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:31,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 19:45:31,772 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2021-12-14 19:45:31,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:31,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648206801] [2021-12-14 19:45:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:31,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:31,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648206801] [2021-12-14 19:45:31,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648206801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:31,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:31,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 19:45:31,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036654756] [2021-12-14 19:45:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:31,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:45:31,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:45:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:45:31,997 INFO L87 Difference]: Start difference. First operand 293 states and 342 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:32,638 INFO L93 Difference]: Finished difference Result 458 states and 494 transitions. [2021-12-14 19:45:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:45:32,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-12-14 19:45:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:32,640 INFO L225 Difference]: With dead ends: 458 [2021-12-14 19:45:32,640 INFO L226 Difference]: Without dead ends: 458 [2021-12-14 19:45:32,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2021-12-14 19:45:32,641 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 805 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:32,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 1200 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:45:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-12-14 19:45:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 293. [2021-12-14 19:45:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 254 states have (on average 1.3425196850393701) internal successors, (341), 292 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 341 transitions. [2021-12-14 19:45:32,645 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 341 transitions. Word has length 40 [2021-12-14 19:45:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:32,645 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 341 transitions. [2021-12-14 19:45:32,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 341 transitions. [2021-12-14 19:45:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:45:32,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:32,646 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:32,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 19:45:32,646 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553849, now seen corresponding path program 1 times [2021-12-14 19:45:32,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:32,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870519514] [2021-12-14 19:45:32,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:32,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:32,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870519514] [2021-12-14 19:45:32,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870519514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:32,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:32,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 19:45:32,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784352355] [2021-12-14 19:45:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:32,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:45:32,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:45:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:45:32,784 INFO L87 Difference]: Start difference. First operand 293 states and 341 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:33,260 INFO L93 Difference]: Finished difference Result 292 states and 339 transitions. [2021-12-14 19:45:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:45:33,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-12-14 19:45:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:33,262 INFO L225 Difference]: With dead ends: 292 [2021-12-14 19:45:33,262 INFO L226 Difference]: Without dead ends: 292 [2021-12-14 19:45:33,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-12-14 19:45:33,262 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 224 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:33,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 835 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-14 19:45:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-12-14 19:45:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 254 states have (on average 1.3346456692913387) internal successors, (339), 291 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) [2021-12-14 19:45:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 339 transitions. [2021-12-14 19:45:33,266 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 339 transitions. Word has length 40 [2021-12-14 19:45:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:33,266 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 339 transitions. [2021-12-14 19:45:33,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:33,266 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 339 transitions. [2021-12-14 19:45:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:45:33,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:33,266 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:33,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 19:45:33,267 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1151553848, now seen corresponding path program 1 times [2021-12-14 19:45:33,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:33,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906106273] [2021-12-14 19:45:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:33,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:33,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:33,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906106273] [2021-12-14 19:45:33,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906106273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:33,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:33,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 19:45:33,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059379939] [2021-12-14 19:45:33,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:33,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 19:45:33,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 19:45:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:45:33,416 INFO L87 Difference]: Start difference. First operand 292 states and 339 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:33,821 INFO L93 Difference]: Finished difference Result 291 states and 337 transitions. [2021-12-14 19:45:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:45:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-12-14 19:45:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:33,822 INFO L225 Difference]: With dead ends: 291 [2021-12-14 19:45:33,822 INFO L226 Difference]: Without dead ends: 291 [2021-12-14 19:45:33,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-12-14 19:45:33,823 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 228 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:33,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 618 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:45:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-12-14 19:45:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-12-14 19:45:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 254 states have (on average 1.3267716535433072) internal successors, (337), 290 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 337 transitions. [2021-12-14 19:45:33,827 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 337 transitions. Word has length 40 [2021-12-14 19:45:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:33,827 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 337 transitions. [2021-12-14 19:45:33,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 337 transitions. [2021-12-14 19:45:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:45:33,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:33,828 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:33,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 19:45:33,828 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1626494914, now seen corresponding path program 1 times [2021-12-14 19:45:33,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:33,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591644514] [2021-12-14 19:45:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:33,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:33,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591644514] [2021-12-14 19:45:33,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591644514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:33,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:33,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:45:33,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225123183] [2021-12-14 19:45:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:33,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:45:33,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:45:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:33,891 INFO L87 Difference]: Start difference. First operand 291 states and 337 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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) [2021-12-14 19:45:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,033 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2021-12-14 19:45:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 [2021-12-14 19:45:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,035 INFO L225 Difference]: With dead ends: 315 [2021-12-14 19:45:34,035 INFO L226 Difference]: Without dead ends: 315 [2021-12-14 19:45:34,035 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:34,036 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 461 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-12-14 19:45:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2021-12-14 19:45:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 251 states have (on average 1.3227091633466135) internal successors, (332), 286 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 332 transitions. [2021-12-14 19:45:34,041 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 332 transitions. Word has length 41 [2021-12-14 19:45:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,042 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 332 transitions. [2021-12-14 19:45:34,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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) [2021-12-14 19:45:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 332 transitions. [2021-12-14 19:45:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:45:34,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,042 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:34,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-14 19:45:34,043 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1357177023, now seen corresponding path program 1 times [2021-12-14 19:45:34,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82744910] [2021-12-14 19:45:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:34,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82744910] [2021-12-14 19:45:34,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82744910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:34,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:34,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:34,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816776587] [2021-12-14 19:45:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:34,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:34,080 INFO L87 Difference]: Start difference. First operand 287 states and 332 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2021-12-14 19:45:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,119 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2021-12-14 19:45:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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 [2021-12-14 19:45:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,120 INFO L225 Difference]: With dead ends: 290 [2021-12-14 19:45:34,120 INFO L226 Difference]: Without dead ends: 290 [2021-12-14 19:45:34,121 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:34,123 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 171 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-14 19:45:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 285. [2021-12-14 19:45:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 250 states have (on average 1.316) internal successors, (329), 284 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) [2021-12-14 19:45:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 329 transitions. [2021-12-14 19:45:34,126 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 329 transitions. Word has length 42 [2021-12-14 19:45:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,127 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 329 transitions. [2021-12-14 19:45:34,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2021-12-14 19:45:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2021-12-14 19:45:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:45:34,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,127 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:34,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-14 19:45:34,128 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -284774687, now seen corresponding path program 1 times [2021-12-14 19:45:34,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:34,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618720863] [2021-12-14 19:45:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:34,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:34,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618720863] [2021-12-14 19:45:34,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618720863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:34,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333261716] [2021-12-14 19:45:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:34,221 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:34,236 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) [2021-12-14 19:45:34,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:45:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:34,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 19:45:34,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:34,340 INFO L388 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 [2021-12-14 19:45:34,343 INFO L388 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 [2021-12-14 19:45:34,362 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:34,362 INFO L388 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 [2021-12-14 19:45:34,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:34,366 INFO L388 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 [2021-12-14 19:45:34,398 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:45:34,399 INFO L388 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 [2021-12-14 19:45:34,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:34,404 INFO L388 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 [2021-12-14 19:45:34,512 INFO L388 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 [2021-12-14 19:45:34,514 INFO L388 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 [2021-12-14 19:45:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:34,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:34,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333261716] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:34,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:45:34,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-14 19:45:34,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626449478] [2021-12-14 19:45:34,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:34,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:45:34,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:34,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:45:34,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:45:34,714 INFO L87 Difference]: Start difference. First operand 285 states and 329 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:34,887 INFO L93 Difference]: Finished difference Result 337 states and 374 transitions. [2021-12-14 19:45:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:45:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 [2021-12-14 19:45:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:34,888 INFO L225 Difference]: With dead ends: 337 [2021-12-14 19:45:34,889 INFO L226 Difference]: Without dead ends: 337 [2021-12-14 19:45:34,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:45:34,890 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:34,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 587 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-14 19:45:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 307. [2021-12-14 19:45:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 272 states have (on average 1.3235294117647058) internal successors, (360), 306 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 360 transitions. [2021-12-14 19:45:34,897 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 360 transitions. Word has length 42 [2021-12-14 19:45:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:34,897 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 360 transitions. [2021-12-14 19:45:34,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 360 transitions. [2021-12-14 19:45:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:45:34,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:34,898 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:34,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 19:45:35,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-14 19:45:35,118 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash -877180804, now seen corresponding path program 1 times [2021-12-14 19:45:35,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:35,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533257613] [2021-12-14 19:45:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:35,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:35,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533257613] [2021-12-14 19:45:35,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533257613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:35,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:35,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:45:35,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742987772] [2021-12-14 19:45:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:35,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:45:35,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:45:35,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:35,215 INFO L87 Difference]: Start difference. First operand 307 states and 360 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:35,473 INFO L93 Difference]: Finished difference Result 354 states and 394 transitions. [2021-12-14 19:45:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:45:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-14 19:45:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:35,474 INFO L225 Difference]: With dead ends: 354 [2021-12-14 19:45:35,474 INFO L226 Difference]: Without dead ends: 354 [2021-12-14 19:45:35,475 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:35,475 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 430 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:35,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 473 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-14 19:45:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 307. [2021-12-14 19:45:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 272 states have (on average 1.3198529411764706) internal successors, (359), 306 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 359 transitions. [2021-12-14 19:45:35,479 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 359 transitions. Word has length 43 [2021-12-14 19:45:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:35,480 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 359 transitions. [2021-12-14 19:45:35,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:35,480 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 359 transitions. [2021-12-14 19:45:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:45:35,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:35,482 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:35,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 19:45:35,482 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash -877180803, now seen corresponding path program 1 times [2021-12-14 19:45:35,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:35,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188882874] [2021-12-14 19:45:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:35,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:35,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188882874] [2021-12-14 19:45:35,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188882874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:35,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:35,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:45:35,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141750124] [2021-12-14 19:45:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:35,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:45:35,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:45:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:45:35,627 INFO L87 Difference]: Start difference. First operand 307 states and 359 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:35,937 INFO L93 Difference]: Finished difference Result 354 states and 393 transitions. [2021-12-14 19:45:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:45:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-14 19:45:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:35,939 INFO L225 Difference]: With dead ends: 354 [2021-12-14 19:45:35,939 INFO L226 Difference]: Without dead ends: 354 [2021-12-14 19:45:35,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:45:35,940 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 312 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:35,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 536 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-14 19:45:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 307. [2021-12-14 19:45:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 272 states have (on average 1.3088235294117647) internal successors, (356), 306 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 356 transitions. [2021-12-14 19:45:35,973 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 356 transitions. Word has length 43 [2021-12-14 19:45:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:35,973 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 356 transitions. [2021-12-14 19:45:35,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 356 transitions. [2021-12-14 19:45:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:45:35,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:35,974 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:35,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 19:45:35,974 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -238079422, now seen corresponding path program 1 times [2021-12-14 19:45:35,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:35,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049177688] [2021-12-14 19:45:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:35,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:36,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:36,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049177688] [2021-12-14 19:45:36,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049177688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:36,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876594051] [2021-12-14 19:45:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:36,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:36,039 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) [2021-12-14 19:45:36,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:45:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:45:36,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:36,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-14 19:45:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:36,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:45:36,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876594051] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:36,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:45:36,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-14 19:45:36,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586475893] [2021-12-14 19:45:36,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:36,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:36,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:36,488 INFO L87 Difference]: Start difference. First operand 307 states and 356 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:36,566 INFO L93 Difference]: Finished difference Result 338 states and 387 transitions. [2021-12-14 19:45:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:45:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-14 19:45:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:36,567 INFO L225 Difference]: With dead ends: 338 [2021-12-14 19:45:36,567 INFO L226 Difference]: Without dead ends: 314 [2021-12-14 19:45:36,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:36,568 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:36,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2021-12-14 19:45:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-12-14 19:45:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-12-14 19:45:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 279 states have (on average 1.3010752688172043) internal successors, (363), 313 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) [2021-12-14 19:45:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 363 transitions. [2021-12-14 19:45:36,571 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 363 transitions. Word has length 43 [2021-12-14 19:45:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:36,571 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 363 transitions. [2021-12-14 19:45:36,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 363 transitions. [2021-12-14 19:45:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:45:36,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:36,572 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:36,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:45:36,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:36,779 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1157151236, now seen corresponding path program 1 times [2021-12-14 19:45:36,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:36,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735977556] [2021-12-14 19:45:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:36,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:36,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:36,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735977556] [2021-12-14 19:45:36,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735977556] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:36,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:36,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:36,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725732547] [2021-12-14 19:45:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:36,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:45:36,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:45:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:45:36,930 INFO L87 Difference]: Start difference. First operand 314 states and 363 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,221 INFO L93 Difference]: Finished difference Result 339 states and 376 transitions. [2021-12-14 19:45:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:45:37,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-14 19:45:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,222 INFO L225 Difference]: With dead ends: 339 [2021-12-14 19:45:37,223 INFO L226 Difference]: Without dead ends: 339 [2021-12-14 19:45:37,223 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:37,223 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 96 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:37,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-12-14 19:45:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 313. [2021-12-14 19:45:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 278 states have (on average 1.2985611510791366) internal successors, (361), 312 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 361 transitions. [2021-12-14 19:45:37,226 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 361 transitions. Word has length 45 [2021-12-14 19:45:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,226 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 361 transitions. [2021-12-14 19:45:37,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 361 transitions. [2021-12-14 19:45:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:45:37,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,227 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:37,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-14 19:45:37,227 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1529922318, now seen corresponding path program 1 times [2021-12-14 19:45:37,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:37,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909547012] [2021-12-14 19:45:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:37,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:37,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909547012] [2021-12-14 19:45:37,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909547012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:37,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:37,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:45:37,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475555492] [2021-12-14 19:45:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:37,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:45:37,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:37,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:45:37,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:45:37,248 INFO L87 Difference]: Start difference. First operand 313 states and 361 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,256 INFO L93 Difference]: Finished difference Result 453 states and 532 transitions. [2021-12-14 19:45:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:45:37,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-14 19:45:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,257 INFO L225 Difference]: With dead ends: 453 [2021-12-14 19:45:37,258 INFO L226 Difference]: Without dead ends: 453 [2021-12-14 19:45:37,258 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:37,258 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 56 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 333 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 [2021-12-14 19:45:37,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 333 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:45:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-12-14 19:45:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 350. [2021-12-14 19:45:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 315 states have (on average 1.33015873015873) internal successors, (419), 349 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) [2021-12-14 19:45:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2021-12-14 19:45:37,262 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 45 [2021-12-14 19:45:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,262 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2021-12-14 19:45:37,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2021-12-14 19:45:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:45:37,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,263 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-14 19:45:37,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-14 19:45:37,263 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1376244065, now seen corresponding path program 1 times [2021-12-14 19:45:37,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:37,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511036033] [2021-12-14 19:45:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:37,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:37,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511036033] [2021-12-14 19:45:37,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511036033] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:37,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:37,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:45:37,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338299215] [2021-12-14 19:45:37,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:37,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:45:37,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:37,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:45:37,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:45:37,307 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,379 INFO L93 Difference]: Finished difference Result 297 states and 331 transitions. [2021-12-14 19:45:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-12-14 19:45:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,380 INFO L225 Difference]: With dead ends: 297 [2021-12-14 19:45:37,380 INFO L226 Difference]: Without dead ends: 297 [2021-12-14 19:45:37,380 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:37,381 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 56 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:37,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 574 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-14 19:45:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2021-12-14 19:45:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 263 states have (on average 1.258555133079848) internal successors, (331), 296 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 331 transitions. [2021-12-14 19:45:37,384 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 331 transitions. Word has length 47 [2021-12-14 19:45:37,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,384 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 331 transitions. [2021-12-14 19:45:37,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 331 transitions. [2021-12-14 19:45:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:45:37,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,384 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:37,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-14 19:45:37,384 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1925957557, now seen corresponding path program 1 times [2021-12-14 19:45:37,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:37,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273340373] [2021-12-14 19:45:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:37,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:37,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273340373] [2021-12-14 19:45:37,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273340373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:37,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:37,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:45:37,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364253451] [2021-12-14 19:45:37,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:37,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:45:37,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:45:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:45:37,426 INFO L87 Difference]: Start difference. First operand 297 states and 331 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) [2021-12-14 19:45:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,518 INFO L93 Difference]: Finished difference Result 328 states and 364 transitions. [2021-12-14 19:45:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:45:37,518 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 49 [2021-12-14 19:45:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,519 INFO L225 Difference]: With dead ends: 328 [2021-12-14 19:45:37,519 INFO L226 Difference]: Without dead ends: 328 [2021-12-14 19:45:37,523 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:45:37,524 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 26 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:37,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 510 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:45:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-14 19:45:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 303. [2021-12-14 19:45:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 269 states have (on average 1.2565055762081785) internal successors, (338), 302 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 338 transitions. [2021-12-14 19:45:37,528 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 338 transitions. Word has length 49 [2021-12-14 19:45:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,529 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 338 transitions. [2021-12-14 19:45:37,529 INFO L471 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) [2021-12-14 19:45:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 338 transitions. [2021-12-14 19:45:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:45:37,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,530 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:37,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-14 19:45:37,530 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1538447444, now seen corresponding path program 1 times [2021-12-14 19:45:37,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:37,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480636659] [2021-12-14 19:45:37,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:45:37,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:37,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480636659] [2021-12-14 19:45:37,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480636659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:37,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:37,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:45:37,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770194130] [2021-12-14 19:45:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:37,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:45:37,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:37,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:45:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:45:37,613 INFO L87 Difference]: Start difference. First operand 303 states and 338 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:37,949 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2021-12-14 19:45:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:45:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2021-12-14 19:45:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:37,950 INFO L225 Difference]: With dead ends: 292 [2021-12-14 19:45:37,950 INFO L226 Difference]: Without dead ends: 292 [2021-12-14 19:45:37,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-12-14 19:45:37,952 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 489 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:37,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 643 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-14 19:45:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 280. [2021-12-14 19:45:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 246 states have (on average 1.2723577235772359) internal successors, (313), 279 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) [2021-12-14 19:45:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 313 transitions. [2021-12-14 19:45:37,955 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 313 transitions. Word has length 50 [2021-12-14 19:45:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:37,955 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 313 transitions. [2021-12-14 19:45:37,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 313 transitions. [2021-12-14 19:45:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:45:37,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:37,956 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:45:37,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-14 19:45:37,956 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1892790768, now seen corresponding path program 1 times [2021-12-14 19:45:37,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:37,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002714599] [2021-12-14 19:45:37,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:37,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:38,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:38,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002714599] [2021-12-14 19:45:38,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002714599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:45:38,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:45:38,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:45:38,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502967221] [2021-12-14 19:45:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:45:38,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:45:38,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:45:38,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:45:38,068 INFO L87 Difference]: Start difference. First operand 280 states and 313 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:45:38,417 INFO L93 Difference]: Finished difference Result 272 states and 304 transitions. [2021-12-14 19:45:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:45:38,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-12-14 19:45:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:45:38,418 INFO L225 Difference]: With dead ends: 272 [2021-12-14 19:45:38,418 INFO L226 Difference]: Without dead ends: 272 [2021-12-14 19:45:38,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:45:38,421 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 93 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:45:38,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 513 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:45:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-14 19:45:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2021-12-14 19:45:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 228 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2021-12-14 19:45:38,425 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 51 [2021-12-14 19:45:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:45:38,425 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2021-12-14 19:45:38,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2021-12-14 19:45:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 19:45:38,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:45:38,426 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:45:38,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-14 19:45:38,426 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:45:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:45:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 426433170, now seen corresponding path program 1 times [2021-12-14 19:45:38,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:45:38,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239404900] [2021-12-14 19:45:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:38,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:45:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:38,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:45:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239404900] [2021-12-14 19:45:38,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239404900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:45:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003367925] [2021-12-14 19:45:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:45:38,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:45:38,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:45:38,679 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) [2021-12-14 19:45:38,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:45:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:45:38,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-14 19:45:38,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:45:38,807 INFO L388 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 [2021-12-14 19:45:38,835 INFO L388 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 [2021-12-14 19:45:38,839 INFO L388 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 [2021-12-14 19:45:38,958 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:45:38,959 INFO L388 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 [2021-12-14 19:45:39,019 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-14 19:45:39,019 INFO L388 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 [2021-12-14 19:45:39,037 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-14 19:45:39,037 INFO L388 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 [2021-12-14 19:45:39,195 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:39,195 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2021-12-14 19:45:39,200 INFO L388 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 26 treesize of output 28 [2021-12-14 19:45:39,485 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:39,485 INFO L388 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 [2021-12-14 19:45:39,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:45:39,490 INFO L388 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 [2021-12-14 19:45:39,856 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:45:39,856 INFO L388 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 53 treesize of output 50 [2021-12-14 19:45:39,860 INFO L388 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 26 treesize of output 28 [2021-12-14 19:45:40,498 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:45:40,498 INFO L388 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 36 treesize of output 28 [2021-12-14 19:45:40,501 INFO L388 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 19 treesize of output 11 [2021-12-14 19:45:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:45:40,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:45:42,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1557 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-14 19:45:43,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1557 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (= 1 (select |c_#valid| .cse0))))) is different from false [2021-12-14 19:45:43,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (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|) v_ArrVal_1556) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1557 (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|) v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse0 0))))) is different from false [2021-12-14 19:45:43,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1553))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1556)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1552) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse0 0)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-14 19:45:43,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse2 (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_1553))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1556)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= 1 (select |c_#valid| .cse0)) (and (= .cse0 0) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= 0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1552) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1553) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1557)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))))))) is different from false [2021-12-14 19:45:43,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (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|) |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_1553))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1556)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (store (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|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1548)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1552) (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|) |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_1553) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse0 0)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-14 19:45:43,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int)) (let ((.cse0 (select (select (let ((.cse1 (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|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1553))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1556)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8| 1) .cse0) 1) (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (store (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|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1548)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1552) (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|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1553) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse0 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0))))) is different from false [2021-12-14 19:45:43,549 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_8| Int)) (let ((.cse0 (select (select (let ((.cse1 (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_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1553))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1556)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8| 1) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (store (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|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1548)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1552) (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_8|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_8| v_ArrVal_1553) |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_8|) 0))))) is different from false [2021-12-14 19:45:44,216 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-14 19:45:44,216 INFO L388 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 151 treesize of output 111 [2021-12-14 19:45:44,231 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-14 19:45:44,231 INFO L388 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 111 treesize of output 123 [2021-12-14 19:45:44,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:45:44,241 INFO L388 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 625 treesize of output 549 [2021-12-14 19:45:44,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:45:44,254 INFO L388 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 645 treesize of output 633 [2021-12-14 19:45:44,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:45:44,291 INFO L388 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 633 treesize of output 595 [2021-12-14 19:45:44,297 INFO L388 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 595 treesize of output 563 [2021-12-14 19:45:44,308 INFO L388 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 237 treesize of output 229 [2021-12-14 19:45:44,317 INFO L388 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 229 treesize of output 213 [2021-12-14 19:45:50,996 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 18 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-14 19:45:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 19:45:51,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003367925] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:45:51,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:45:51,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40 [2021-12-14 19:45:51,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832734938] [2021-12-14 19:45:51,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:45:51,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-14 19:45:51,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:45:51,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-14 19:45:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=868, Unknown=9, NotChecked=536, Total=1560 [2021-12-14 19:45:51,030 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:45:53,193 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse3 .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 0) (= (select .cse3 .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse4 (select (select (let ((.cse5 (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|) |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_1553))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1556)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (store (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|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1548)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1552) (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|) |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_1553) |c_ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1557) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 0)) (= .cse4 0)) (= (select |c_#valid| .cse4) 1)))) (< |c_ULTIMATE.start_main_~end~0#1.offset| (+ |c_ULTIMATE.start_main_~list~0#1.offset| 1)))) is different from false [2021-12-14 19:46:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:04,293 INFO L93 Difference]: Finished difference Result 354 states and 388 transitions. [2021-12-14 19:46:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 19:46:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 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 54 [2021-12-14 19:46:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:04,295 INFO L225 Difference]: With dead ends: 354 [2021-12-14 19:46:04,295 INFO L226 Difference]: Without dead ends: 354 [2021-12-14 19:46:04,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=331, Invalid=1946, Unknown=15, NotChecked=900, Total=3192 [2021-12-14 19:46:04,296 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 513 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1828 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:04,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1435 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 867 Invalid, 0 Unknown, 1828 Unchecked, 0.4s Time] [2021-12-14 19:46:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-14 19:46:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 259. [2021-12-14 19:46:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.2340425531914894) internal successors, (290), 258 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2021-12-14 19:46:04,298 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 54 [2021-12-14 19:46:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:04,298 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2021-12-14 19:46:04,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.675) internal successors, (147), 40 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2021-12-14 19:46:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:46:04,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:04,299 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2021-12-14 19:46:04,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:04,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:04,501 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:46:04,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851803, now seen corresponding path program 1 times [2021-12-14 19:46:04,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132744180] [2021-12-14 19:46:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:04,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:04,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132744180] [2021-12-14 19:46:04,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132744180] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029229373] [2021-12-14 19:46:04,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:04,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:04,751 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) [2021-12-14 19:46:04,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:46:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:04,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-14 19:46:04,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:04,892 INFO L388 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 [2021-12-14 19:46:04,998 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:46:04,998 INFO L388 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 [2021-12-14 19:46:05,034 INFO L388 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 [2021-12-14 19:46:05,118 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:05,118 INFO L388 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 [2021-12-14 19:46:05,208 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:05,209 INFO L388 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 [2021-12-14 19:46:05,290 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:05,291 INFO L388 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 [2021-12-14 19:46:05,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:05,479 INFO L388 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 [2021-12-14 19:46:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:05,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:06,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:06,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2021-12-14 19:46:06,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:06,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2021-12-14 19:46:06,113 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:06,113 INFO L388 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 212 treesize of output 204 [2021-12-14 19:46:06,137 INFO L388 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 196 treesize of output 188 [2021-12-14 19:46:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:13,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029229373] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:46:13,314 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:46:13,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2021-12-14 19:46:13,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269733038] [2021-12-14 19:46:13,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:46:13,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:46:13,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:46:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=991, Unknown=25, NotChecked=0, Total=1190 [2021-12-14 19:46:13,316 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:14,661 INFO L93 Difference]: Finished difference Result 541 states and 573 transitions. [2021-12-14 19:46:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-14 19:46:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 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 [2021-12-14 19:46:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:14,663 INFO L225 Difference]: With dead ends: 541 [2021-12-14 19:46:14,663 INFO L226 Difference]: Without dead ends: 541 [2021-12-14 19:46:14,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=571, Invalid=2374, Unknown=25, NotChecked=0, Total=2970 [2021-12-14 19:46:14,664 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 1276 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1385 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:14,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1276 Valid, 2155 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1505 Invalid, 0 Unknown, 1385 Unchecked, 0.8s Time] [2021-12-14 19:46:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-12-14 19:46:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 343. [2021-12-14 19:46:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 319 states have (on average 1.2163009404388714) internal successors, (388), 342 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 388 transitions. [2021-12-14 19:46:14,669 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 388 transitions. Word has length 56 [2021-12-14 19:46:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:14,669 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 388 transitions. [2021-12-14 19:46:14,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 388 transitions. [2021-12-14 19:46:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:46:14,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:14,672 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2021-12-14 19:46:14,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:14,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-12-14 19:46:14,903 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:46:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2048851802, now seen corresponding path program 1 times [2021-12-14 19:46:14,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:14,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657147032] [2021-12-14 19:46:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:14,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:15,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:15,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657147032] [2021-12-14 19:46:15,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657147032] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558200680] [2021-12-14 19:46:15,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:15,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:15,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:15,069 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) [2021-12-14 19:46:15,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:46:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:15,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-14 19:46:15,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:15,296 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 19:46:15,296 INFO L388 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 19 treesize of output 18 [2021-12-14 19:46:15,318 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-14 19:46:15,318 INFO L388 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 19 treesize of output 26 [2021-12-14 19:46:15,457 INFO L354 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2021-12-14 19:46:15,458 INFO L388 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 94 treesize of output 78 [2021-12-14 19:46:15,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:15,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:15,470 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 19:46:15,470 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2021-12-14 19:46:15,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:15,917 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-12-14 19:46:15,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 76 [2021-12-14 19:46:15,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:15,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:15,930 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 59 [2021-12-14 19:46:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:16,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:16,740 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:16,741 INFO L388 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 63 treesize of output 67 [2021-12-14 19:46:22,549 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:22,550 INFO L388 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 380 treesize of output 295 [2021-12-14 19:46:22,567 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:22,567 INFO L388 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 865 treesize of output 612 [2021-12-14 19:46:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:23,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558200680] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:46:23,217 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:46:23,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2021-12-14 19:46:23,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959493276] [2021-12-14 19:46:23,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:46:23,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 19:46:23,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:23,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 19:46:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 19:46:23,218 INFO L87 Difference]: Start difference. First operand 343 states and 388 transitions. Second operand has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:26,033 INFO L93 Difference]: Finished difference Result 563 states and 629 transitions. [2021-12-14 19:46:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-14 19:46:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 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 [2021-12-14 19:46:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:26,035 INFO L225 Difference]: With dead ends: 563 [2021-12-14 19:46:26,035 INFO L226 Difference]: Without dead ends: 563 [2021-12-14 19:46:26,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=557, Invalid=3103, Unknown=0, NotChecked=0, Total=3660 [2021-12-14 19:46:26,036 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 1051 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:26,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1051 Valid, 1532 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1265 Invalid, 0 Unknown, 539 Unchecked, 0.7s Time] [2021-12-14 19:46:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-12-14 19:46:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 368. [2021-12-14 19:46:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 344 states have (on average 1.2238372093023255) internal successors, (421), 367 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) [2021-12-14 19:46:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 421 transitions. [2021-12-14 19:46:26,040 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 421 transitions. Word has length 56 [2021-12-14 19:46:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:26,040 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 421 transitions. [2021-12-14 19:46:26,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 5.1875) internal successors, (166), 33 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 421 transitions. [2021-12-14 19:46:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 19:46:26,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:26,040 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-14 19:46:26,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:26,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-14 19:46:26,259 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 82 more)] === [2021-12-14 19:46:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1627380482, now seen corresponding path program 1 times [2021-12-14 19:46:26,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860823299] [2021-12-14 19:46:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:26,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:26,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860823299] [2021-12-14 19:46:26,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860823299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795032055] [2021-12-14 19:46:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:26,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:26,760 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) [2021-12-14 19:46:26,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:46:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:26,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-14 19:46:26,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:26,910 INFO L388 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 [2021-12-14 19:46:26,944 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:26,944 INFO L388 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 [2021-12-14 19:46:26,952 INFO L388 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 [2021-12-14 19:46:26,955 INFO L388 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 [2021-12-14 19:46:26,995 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:26,995 INFO L388 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 35 treesize of output 36 [2021-12-14 19:46:26,998 INFO L388 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 [2021-12-14 19:46:27,047 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:27,048 INFO L388 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 35 treesize of output 36 [2021-12-14 19:46:27,050 INFO L388 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 [2021-12-14 19:46:28,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:28,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:28,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:28,106 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-12-14 19:46:28,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 48 [2021-12-14 19:46:28,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:28,114 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:46:28,115 INFO L388 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 1 case distinctions, treesize of input 36 treesize of output 23 [2021-12-14 19:46:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:28,120 INFO L328 TraceCheckSpWp]: Computing backward predicates...