./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:58:45,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:58:45,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:58:45,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:58:45,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:58:45,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:58:45,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:58:45,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:58:45,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:58:45,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:58:45,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:58:45,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:58:45,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:58:45,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:58:45,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:58:45,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:58:45,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:58:45,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:58:45,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:58:45,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:58:45,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:58:45,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:58:45,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:58:45,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:58:45,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:58:45,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:58:45,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:58:45,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:58:45,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:58:45,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:58:45,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:58:45,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:58:45,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:58:45,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:58:45,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:58:45,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:58:45,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:58:45,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:58:45,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:58:45,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:58:45,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:58:45,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 05:58:45,934 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:58:45,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:58:45,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:58:45,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:58:45,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:58:45,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:58:45,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:58:45,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:58:45,938 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:58:45,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:58:45,939 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:58:45,939 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:58:45,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:58:45,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:58:45,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:58:45,939 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:58:45,940 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:58:45,940 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:58:45,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:58:45,940 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:58:45,940 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:58:45,940 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:58:45,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:58:45,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:58:45,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:58:45,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:58:45,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:58:45,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:58:45,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:58:45,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:58:45,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2021-12-28 05:58:46,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:58:46,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:58:46,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:58:46,233 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:58:46,234 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:58:46,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2021-12-28 05:58:46,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec74e89f/90bef26cba21492d8d7267b3ac6b4d52/FLAG037c715a4 [2021-12-28 05:58:46,703 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:58:46,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2021-12-28 05:58:46,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec74e89f/90bef26cba21492d8d7267b3ac6b4d52/FLAG037c715a4 [2021-12-28 05:58:46,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec74e89f/90bef26cba21492d8d7267b3ac6b4d52 [2021-12-28 05:58:46,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:58:46,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:58:46,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:58:46,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:58:46,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:58:46,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:58:46" (1/1) ... [2021-12-28 05:58:46,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea8b949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:46, skipping insertion in model container [2021-12-28 05:58:46,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:58:46" (1/1) ... [2021-12-28 05:58:46,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:58:46,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:58:47,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2021-12-28 05:58:47,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2021-12-28 05:58:47,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2021-12-28 05:58:47,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2021-12-28 05:58:47,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2021-12-28 05:58:47,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2021-12-28 05:58:47,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2021-12-28 05:58:47,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2021-12-28 05:58:47,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2021-12-28 05:58:47,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2021-12-28 05:58:47,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2021-12-28 05:58:47,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2021-12-28 05:58:47,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2021-12-28 05:58:47,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:58:47,076 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:58:47,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2021-12-28 05:58:47,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2021-12-28 05:58:47,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2021-12-28 05:58:47,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2021-12-28 05:58:47,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2021-12-28 05:58:47,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2021-12-28 05:58:47,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2021-12-28 05:58:47,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2021-12-28 05:58:47,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2021-12-28 05:58:47,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2021-12-28 05:58:47,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2021-12-28 05:58:47,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2021-12-28 05:58:47,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2021-12-28 05:58:47,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:58:47,157 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:58:47,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47 WrapperNode [2021-12-28 05:58:47,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:58:47,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:58:47,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:58:47,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:58:47,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,215 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 227 [2021-12-28 05:58:47,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:58:47,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:58:47,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:58:47,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:58:47,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:58:47,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:58:47,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:58:47,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:58:47,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (1/1) ... [2021-12-28 05:58:47,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:58:47,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:47,276 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-28 05:58:47,279 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-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:58:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:58:47,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:58:47,402 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:58:47,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:58:47,821 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:58:47,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:58:47,830 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-28 05:58:47,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:58:47 BoogieIcfgContainer [2021-12-28 05:58:47,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:58:47,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:58:47,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:58:47,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:58:47,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:58:46" (1/3) ... [2021-12-28 05:58:47,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ac577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:58:47, skipping insertion in model container [2021-12-28 05:58:47,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:47" (2/3) ... [2021-12-28 05:58:47,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ac577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:58:47, skipping insertion in model container [2021-12-28 05:58:47,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:58:47" (3/3) ... [2021-12-28 05:58:47,839 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2021-12-28 05:58:47,843 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:58:47,843 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2021-12-28 05:58:47,868 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:58:47,872 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-28 05:58:47,873 INFO L340 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2021-12-28 05:58:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:58:47,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:47,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:58:47,888 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:58:47,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:47,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603562882] [2021-12-28 05:58:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:47,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,015 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-28 05:58:48,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603562882] [2021-12-28 05:58:48,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603562882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:58:48,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887655955] [2021-12-28 05:58:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:48,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:48,041 INFO L87 Difference]: Start difference. First operand has 190 states, 111 states have (on average 2.18018018018018) internal successors, (242), 189 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:48,159 INFO L93 Difference]: Finished difference Result 192 states and 201 transitions. [2021-12-28 05:58:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:48,161 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-28 05:58:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:48,166 INFO L225 Difference]: With dead ends: 192 [2021-12-28 05:58:48,167 INFO L226 Difference]: Without dead ends: 188 [2021-12-28 05:58:48,168 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-28 05:58:48,170 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:48,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 119 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-28 05:58:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2021-12-28 05:58:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 182 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2021-12-28 05:58:48,201 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 3 [2021-12-28 05:58:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:48,201 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2021-12-28 05:58:48,202 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-28 05:58:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2021-12-28 05:58:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:58:48,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:48,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:58:48,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:58:48,203 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:58:48,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005048098] [2021-12-28 05:58:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:48,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,240 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-28 05:58:48,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005048098] [2021-12-28 05:58:48,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005048098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:58:48,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2517581] [2021-12-28 05:58:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:48,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:48,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:48,245 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:48,352 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2021-12-28 05:58:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:48,352 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-28 05:58:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:48,353 INFO L225 Difference]: With dead ends: 213 [2021-12-28 05:58:48,353 INFO L226 Difference]: Without dead ends: 213 [2021-12-28 05:58:48,354 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-28 05:58:48,355 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:48,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 145 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-28 05:58:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2021-12-28 05:58:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.6615384615384616) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2021-12-28 05:58:48,362 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 3 [2021-12-28 05:58:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:48,362 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2021-12-28 05:58:48,362 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-28 05:58:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2021-12-28 05:58:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 05:58:48,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:48,363 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 05:58:48,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:58:48,363 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2021-12-28 05:58:48,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:48,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873473288] [2021-12-28 05:58:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:48,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,389 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-28 05:58:48,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873473288] [2021-12-28 05:58:48,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873473288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:48,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103905844] [2021-12-28 05:58:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:48,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:48,392 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:48,429 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2021-12-28 05:58:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:48,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-28 05:58:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:48,430 INFO L225 Difference]: With dead ends: 208 [2021-12-28 05:58:48,430 INFO L226 Difference]: Without dead ends: 208 [2021-12-28 05:58:48,430 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-28 05:58:48,431 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 169 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:48,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-28 05:58:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2021-12-28 05:58:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 190 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2021-12-28 05:58:48,437 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 5 [2021-12-28 05:58:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:48,438 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2021-12-28 05:58:48,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2021-12-28 05:58:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:58:48,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:48,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:48,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:58:48,439 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2021-12-28 05:58:48,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:48,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279910466] [2021-12-28 05:58:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:48,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,481 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-28 05:58:48,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279910466] [2021-12-28 05:58:48,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279910466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:48,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295228042] [2021-12-28 05:58:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:48,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:48,496 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:48,629 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2021-12-28 05:58:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:58:48,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:58:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:48,631 INFO L225 Difference]: With dead ends: 190 [2021-12-28 05:58:48,631 INFO L226 Difference]: Without dead ends: 190 [2021-12-28 05:58:48,631 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-28 05:58:48,632 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:48,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-28 05:58:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-28 05:58:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-12-28 05:58:48,644 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 11 [2021-12-28 05:58:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:48,644 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-12-28 05:58:48,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-12-28 05:58:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:58:48,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:48,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:48,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:58:48,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2021-12-28 05:58:48,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:48,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92592552] [2021-12-28 05:58:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:48,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,702 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-28 05:58:48,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92592552] [2021-12-28 05:58:48,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92592552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:48,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462294596] [2021-12-28 05:58:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:48,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:48,705 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:48,828 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2021-12-28 05:58:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:58:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:58:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:48,830 INFO L225 Difference]: With dead ends: 189 [2021-12-28 05:58:48,830 INFO L226 Difference]: Without dead ends: 189 [2021-12-28 05:58:48,830 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-28 05:58:48,831 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 2 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:48,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 529 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-28 05:58:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-28 05:58:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2021-12-28 05:58:48,847 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 11 [2021-12-28 05:58:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:48,847 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2021-12-28 05:58:48,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2021-12-28 05:58:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:58:48,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:48,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:48,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:58:48,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:48,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2021-12-28 05:58:48,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:48,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898341655] [2021-12-28 05:58:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:48,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,879 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-28 05:58:48,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898341655] [2021-12-28 05:58:48,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898341655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:48,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105970831] [2021-12-28 05:58:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:48,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:48,882 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:48,888 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2021-12-28 05:58:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-28 05:58:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:48,895 INFO L225 Difference]: With dead ends: 190 [2021-12-28 05:58:48,895 INFO L226 Difference]: Without dead ends: 190 [2021-12-28 05:58:48,896 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-28 05:58:48,896 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:48,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-28 05:58:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-28 05:58:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.6307692307692307) internal successors, (212), 189 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-12-28 05:58:48,899 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 13 [2021-12-28 05:58:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:48,899 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-12-28 05:58:48,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-12-28 05:58:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:58:48,900 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:48,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:48,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:58:48,900 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:48,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2021-12-28 05:58:48,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:48,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369492065] [2021-12-28 05:58:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:48,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:48,979 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-28 05:58:48,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369492065] [2021-12-28 05:58:48,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369492065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:48,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:48,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:58:48,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001800167] [2021-12-28 05:58:48,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:48,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:58:48,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:58:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:58:48,981 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:49,175 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2021-12-28 05:58:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:58:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-28 05:58:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:49,176 INFO L225 Difference]: With dead ends: 190 [2021-12-28 05:58:49,176 INFO L226 Difference]: Without dead ends: 190 [2021-12-28 05:58:49,177 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-28 05:58:49,177 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:49,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 441 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-28 05:58:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2021-12-28 05:58:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.623076923076923) internal successors, (211), 188 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2021-12-28 05:58:49,180 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 14 [2021-12-28 05:58:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:49,180 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2021-12-28 05:58:49,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2021-12-28 05:58:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:58:49,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:49,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:49,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:58:49,182 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2021-12-28 05:58:49,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:49,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917254757] [2021-12-28 05:58:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:49,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:49,303 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-28 05:58:49,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:49,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917254757] [2021-12-28 05:58:49,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917254757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:49,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:49,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:58:49,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981862497] [2021-12-28 05:58:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:49,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:58:49,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:58:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:58:49,305 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:49,552 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2021-12-28 05:58:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:58:49,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-28 05:58:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:49,553 INFO L225 Difference]: With dead ends: 189 [2021-12-28 05:58:49,553 INFO L226 Difference]: Without dead ends: 189 [2021-12-28 05:58:49,553 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-28 05:58:49,554 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 162 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:49,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 479 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-28 05:58:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2021-12-28 05:58:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2021-12-28 05:58:49,556 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 14 [2021-12-28 05:58:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:49,557 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2021-12-28 05:58:49,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2021-12-28 05:58:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:58:49,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:49,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:49,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:58:49,557 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2021-12-28 05:58:49,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:49,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836112098] [2021-12-28 05:58:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:49,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:49,628 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-28 05:58:49,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:49,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836112098] [2021-12-28 05:58:49,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836112098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:49,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:49,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:58:49,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447321030] [2021-12-28 05:58:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:49,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:58:49,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:49,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:58:49,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:58:49,630 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:49,794 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2021-12-28 05:58:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:58:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-28 05:58:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:49,795 INFO L225 Difference]: With dead ends: 275 [2021-12-28 05:58:49,795 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 05:58:49,795 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-28 05:58:49,796 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 193 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:49,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 699 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 05:58:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2021-12-28 05:58:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.6171875) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2021-12-28 05:58:49,799 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 15 [2021-12-28 05:58:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:49,799 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2021-12-28 05:58:49,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2021-12-28 05:58:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:58:49,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:49,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:49,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:58:49,800 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2021-12-28 05:58:49,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:49,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602105566] [2021-12-28 05:58:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:49,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:49,858 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-28 05:58:49,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602105566] [2021-12-28 05:58:49,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602105566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:49,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:49,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:58:49,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849596761] [2021-12-28 05:58:49,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:49,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:49,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:49,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:49,861 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:49,957 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2021-12-28 05:58:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:58:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-28 05:58:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:49,958 INFO L225 Difference]: With dead ends: 276 [2021-12-28 05:58:49,958 INFO L226 Difference]: Without dead ends: 276 [2021-12-28 05:58:49,959 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-28 05:58:49,959 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:49,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 582 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-28 05:58:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 188. [2021-12-28 05:58:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 131 states have (on average 1.6030534351145038) internal successors, (210), 187 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2021-12-28 05:58:49,963 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 17 [2021-12-28 05:58:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:49,963 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2021-12-28 05:58:49,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2021-12-28 05:58:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:58:49,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:49,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:49,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:58:49,964 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2021-12-28 05:58:49,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:49,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789026611] [2021-12-28 05:58:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:49,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,040 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-28 05:58:50,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789026611] [2021-12-28 05:58:50,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789026611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:58:50,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534901407] [2021-12-28 05:58:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:58:50,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:58:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:58:50,042 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,196 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2021-12-28 05:58:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:58:50,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-28 05:58:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,198 INFO L225 Difference]: With dead ends: 248 [2021-12-28 05:58:50,198 INFO L226 Difference]: Without dead ends: 248 [2021-12-28 05:58:50,198 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-28 05:58:50,198 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 488 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 186 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-28 05:58:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2021-12-28 05:58:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 154 states have (on average 1.603896103896104) internal successors, (247), 210 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2021-12-28 05:58:50,202 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 19 [2021-12-28 05:58:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,203 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2021-12-28 05:58:50,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2021-12-28 05:58:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:58:50,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,203 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] [2021-12-28 05:58:50,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:58:50,204 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2021-12-28 05:58:50,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001011792] [2021-12-28 05:58:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,225 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-28 05:58:50,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001011792] [2021-12-28 05:58:50,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001011792] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:50,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365319208] [2021-12-28 05:58:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:50,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:50,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:50,227 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,299 INFO L93 Difference]: Finished difference Result 243 states and 257 transitions. [2021-12-28 05:58:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:58:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-28 05:58:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,301 INFO L225 Difference]: With dead ends: 243 [2021-12-28 05:58:50,301 INFO L226 Difference]: Without dead ends: 243 [2021-12-28 05:58:50,301 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-28 05:58:50,301 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 228 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 277 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-28 05:58:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2021-12-28 05:58:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.5947712418300655) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2021-12-28 05:58:50,305 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 21 [2021-12-28 05:58:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,305 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2021-12-28 05:58:50,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2021-12-28 05:58:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:58:50,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,306 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-28 05:58:50,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:58:50,306 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2021-12-28 05:58:50,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764993377] [2021-12-28 05:58:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,336 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-28 05:58:50,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764993377] [2021-12-28 05:58:50,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764993377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:58:50,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636306145] [2021-12-28 05:58:50,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:58:50,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:58:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:58:50,338 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,486 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2021-12-28 05:58:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:58:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 05:58:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,488 INFO L225 Difference]: With dead ends: 198 [2021-12-28 05:58:50,488 INFO L226 Difference]: Without dead ends: 198 [2021-12-28 05:58:50,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:58:50,488 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 98 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 427 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-28 05:58:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-12-28 05:58:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 196 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2021-12-28 05:58:50,491 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 23 [2021-12-28 05:58:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,491 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2021-12-28 05:58:50,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2021-12-28 05:58:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:58:50,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,491 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-28 05:58:50,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:58:50,492 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2021-12-28 05:58:50,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736709218] [2021-12-28 05:58:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,565 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-28 05:58:50,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736709218] [2021-12-28 05:58:50,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736709218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:58:50,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292749864] [2021-12-28 05:58:50,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:58:50,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:58:50,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:58:50,567 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,739 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2021-12-28 05:58:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:58:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 05:58:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,741 INFO L225 Difference]: With dead ends: 190 [2021-12-28 05:58:50,741 INFO L226 Difference]: Without dead ends: 190 [2021-12-28 05:58:50,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:58:50,741 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-28 05:58:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2021-12-28 05:58:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2021-12-28 05:58:50,744 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2021-12-28 05:58:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,744 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2021-12-28 05:58:50,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2021-12-28 05:58:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:58:50,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,745 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] [2021-12-28 05:58:50,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:58:50,745 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2021-12-28 05:58:50,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356108673] [2021-12-28 05:58:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,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-28 05:58:50,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356108673] [2021-12-28 05:58:50,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356108673] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:58:50,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693112609] [2021-12-28 05:58:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:58:50,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:58:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:58:50,784 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,881 INFO L93 Difference]: Finished difference Result 186 states and 219 transitions. [2021-12-28 05:58:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:58:50,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-28 05:58:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,882 INFO L225 Difference]: With dead ends: 186 [2021-12-28 05:58:50,882 INFO L226 Difference]: Without dead ends: 186 [2021-12-28 05:58:50,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:58:50,883 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 38 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-28 05:58:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2021-12-28 05:58:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 178 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2021-12-28 05:58:50,885 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 25 [2021-12-28 05:58:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,886 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2021-12-28 05:58:50,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2021-12-28 05:58:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:58:50,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,886 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-28 05:58:50,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:58:50,887 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash 476921454, now seen corresponding path program 1 times [2021-12-28 05:58:50,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459424367] [2021-12-28 05:58:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,905 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-28 05:58:50,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459424367] [2021-12-28 05:58:50,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459424367] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:50,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903005094] [2021-12-28 05:58:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:50,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:50,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:50,907 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,913 INFO L93 Difference]: Finished difference Result 252 states and 299 transitions. [2021-12-28 05:58:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:50,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-28 05:58:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,915 INFO L225 Difference]: With dead ends: 252 [2021-12-28 05:58:50,915 INFO L226 Difference]: Without dead ends: 252 [2021-12-28 05:58:50,915 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-28 05:58:50,915 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 50 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-28 05:58:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 185. [2021-12-28 05:58:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 184 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2021-12-28 05:58:50,919 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 27 [2021-12-28 05:58:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,920 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2021-12-28 05:58:50,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2021-12-28 05:58:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:58:50,920 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,921 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-28 05:58:50,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:58:50,921 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2021-12-28 05:58:50,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006512881] [2021-12-28 05:58:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:50,954 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-28 05:58:50,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:50,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006512881] [2021-12-28 05:58:50,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006512881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:50,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:50,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:50,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814475876] [2021-12-28 05:58:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:50,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:50,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:50,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:50,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:50,957 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:50,969 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2021-12-28 05:58:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:50,969 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-28 05:58:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:50,970 INFO L225 Difference]: With dead ends: 183 [2021-12-28 05:58:50,970 INFO L226 Difference]: Without dead ends: 183 [2021-12-28 05:58:50,970 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-28 05:58:50,971 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:50,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-28 05:58:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-28 05:58:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 182 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2021-12-28 05:58:50,974 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 28 [2021-12-28 05:58:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:50,974 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2021-12-28 05:58:50,974 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-28 05:58:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2021-12-28 05:58:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 05:58:50,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:50,975 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-28 05:58:50,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:58:50,976 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:50,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2021-12-28 05:58:50,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:50,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045363950] [2021-12-28 05:58:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:50,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:51,081 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-28 05:58:51,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:51,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045363950] [2021-12-28 05:58:51,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045363950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:51,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:51,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:58:51,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083637354] [2021-12-28 05:58:51,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:51,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:58:51,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:58:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:58:51,082 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:51,343 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2021-12-28 05:58:51,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:58:51,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-28 05:58:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:51,345 INFO L225 Difference]: With dead ends: 308 [2021-12-28 05:58:51,345 INFO L226 Difference]: Without dead ends: 308 [2021-12-28 05:58:51,345 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-28 05:58:51,346 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 390 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:51,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 783 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-12-28 05:58:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 216. [2021-12-28 05:58:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2021-12-28 05:58:51,349 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 29 [2021-12-28 05:58:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:51,349 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2021-12-28 05:58:51,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2021-12-28 05:58:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:58:51,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:51,350 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] [2021-12-28 05:58:51,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:58:51,350 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1786976426, now seen corresponding path program 1 times [2021-12-28 05:58:51,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57013719] [2021-12-28 05:58:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:51,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:51,408 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-28 05:58:51,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57013719] [2021-12-28 05:58:51,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57013719] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:58:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686787324] [2021-12-28 05:58:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:51,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:51,411 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-28 05:58:51,443 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-28 05:58:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:51,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-28 05:58:51,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:51,556 INFO L387 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-28 05:58:51,560 INFO L387 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-28 05:58:51,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:51,609 INFO L387 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-28 05:58:51,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:51,614 INFO L387 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-28 05:58:51,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:51,763 INFO L387 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-28 05:58:51,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:51,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:51,791 INFO L387 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-28 05:58:51,801 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-28 05:58:51,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:58:54,382 INFO L387 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-28 05:58:54,385 INFO L387 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-28 05:58:54,390 INFO L387 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-28 05:58:54,394 INFO L387 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-28 05:58:54,410 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-28 05:58:54,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686787324] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:58:54,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:58:54,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-28 05:58:54,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186325948] [2021-12-28 05:58:54,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:58:54,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:58:54,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:58:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:58:54,413 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:54,751 INFO L93 Difference]: Finished difference Result 471 states and 539 transitions. [2021-12-28 05:58:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:58:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 05:58:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:54,752 INFO L225 Difference]: With dead ends: 471 [2021-12-28 05:58:54,752 INFO L226 Difference]: Without dead ends: 471 [2021-12-28 05:58:54,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-12-28 05:58:54,753 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 528 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:54,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 1062 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 413 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2021-12-28 05:58:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-12-28 05:58:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 251. [2021-12-28 05:58:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 250 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2021-12-28 05:58:54,757 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 31 [2021-12-28 05:58:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:54,758 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2021-12-28 05:58:54,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2021-12-28 05:58:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 05:58:54,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:54,759 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] [2021-12-28 05:58:54,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:54,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:54,963 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2021-12-28 05:58:54,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:54,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960524942] [2021-12-28 05:58:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:54,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:55,002 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-28 05:58:55,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:55,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960524942] [2021-12-28 05:58:55,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960524942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:55,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:55,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:55,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403551695] [2021-12-28 05:58:55,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:55,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:55,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:55,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:55,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:55,005 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:55,097 INFO L93 Difference]: Finished difference Result 250 states and 301 transitions. [2021-12-28 05:58:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:58:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-28 05:58:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:55,098 INFO L225 Difference]: With dead ends: 250 [2021-12-28 05:58:55,098 INFO L226 Difference]: Without dead ends: 250 [2021-12-28 05:58:55,099 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-28 05:58:55,100 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:55,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 408 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-28 05:58:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-12-28 05:58:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 249 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2021-12-28 05:58:55,118 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 33 [2021-12-28 05:58:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:55,118 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2021-12-28 05:58:55,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2021-12-28 05:58:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 05:58:55,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:55,119 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] [2021-12-28 05:58:55,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:58:55,120 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2021-12-28 05:58:55,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:55,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550670224] [2021-12-28 05:58:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:55,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:55,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-28 05:58:55,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550670224] [2021-12-28 05:58:55,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550670224] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:55,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:55,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:55,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378689470] [2021-12-28 05:58:55,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:55,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:55,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:55,178 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:55,278 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2021-12-28 05:58:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:58:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-28 05:58:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:55,280 INFO L225 Difference]: With dead ends: 249 [2021-12-28 05:58:55,280 INFO L226 Difference]: Without dead ends: 249 [2021-12-28 05:58:55,280 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-28 05:58:55,280 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:55,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 411 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-28 05:58:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2021-12-28 05:58:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.36986301369863) internal successors, (300), 248 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2021-12-28 05:58:55,284 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 33 [2021-12-28 05:58:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:55,284 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2021-12-28 05:58:55,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2021-12-28 05:58:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 05:58:55,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:55,285 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] [2021-12-28 05:58:55,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:58:55,285 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2021-12-28 05:58:55,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:55,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11248389] [2021-12-28 05:58:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:55,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:55,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-28 05:58:55,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:55,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11248389] [2021-12-28 05:58:55,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11248389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:55,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:55,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:58:55,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841169862] [2021-12-28 05:58:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:55,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:58:55,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:58:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:58:55,367 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:55,774 INFO L93 Difference]: Finished difference Result 364 states and 406 transitions. [2021-12-28 05:58:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:58:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 05:58:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:55,778 INFO L225 Difference]: With dead ends: 364 [2021-12-28 05:58:55,778 INFO L226 Difference]: Without dead ends: 364 [2021-12-28 05:58:55,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-12-28 05:58:55,778 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 491 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:55,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 905 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-12-28 05:58:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 250. [2021-12-28 05:58:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 249 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2021-12-28 05:58:55,782 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 34 [2021-12-28 05:58:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:55,783 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2021-12-28 05:58:55,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2021-12-28 05:58:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 05:58:55,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:55,783 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] [2021-12-28 05:58:55,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 05:58:55,784 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2021-12-28 05:58:55,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:55,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569383877] [2021-12-28 05:58:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:55,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:55,947 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-28 05:58:55,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:55,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569383877] [2021-12-28 05:58:55,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569383877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:55,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:55,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:58:55,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646645298] [2021-12-28 05:58:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:55,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:58:55,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:58:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:58:55,949 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:56,481 INFO L93 Difference]: Finished difference Result 428 states and 464 transitions. [2021-12-28 05:58:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:58:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 05:58:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:56,483 INFO L225 Difference]: With dead ends: 428 [2021-12-28 05:58:56,483 INFO L226 Difference]: Without dead ends: 428 [2021-12-28 05:58:56,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:58:56,484 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 451 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:56,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 1024 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:58:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-12-28 05:58:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 256. [2021-12-28 05:58:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 228 states have (on average 1.337719298245614) internal successors, (305), 255 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2021-12-28 05:58:56,487 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 34 [2021-12-28 05:58:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:56,487 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2021-12-28 05:58:56,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2021-12-28 05:58:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:58:56,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:56,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-28 05:58:56,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 05:58:56,488 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2021-12-28 05:58:56,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:56,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525240250] [2021-12-28 05:58:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:56,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:56,511 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-28 05:58:56,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:56,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525240250] [2021-12-28 05:58:56,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525240250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:56,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:56,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:56,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992026476] [2021-12-28 05:58:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:56,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:56,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:56,513 INFO L87 Difference]: Start difference. First operand 256 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:56,518 INFO L93 Difference]: Finished difference Result 258 states and 307 transitions. [2021-12-28 05:58:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:56,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 05:58:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:56,520 INFO L225 Difference]: With dead ends: 258 [2021-12-28 05:58:56,520 INFO L226 Difference]: Without dead ends: 258 [2021-12-28 05:58:56,520 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-28 05:58:56,521 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:56,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-28 05:58:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2021-12-28 05:58:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3347826086956522) internal successors, (307), 257 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2021-12-28 05:58:56,525 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 35 [2021-12-28 05:58:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:56,527 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2021-12-28 05:58:56,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2021-12-28 05:58:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:58:56,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:56,528 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] [2021-12-28 05:58:56,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 05:58:56,528 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:56,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2021-12-28 05:58:56,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:56,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343114005] [2021-12-28 05:58:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:56,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:56,723 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-28 05:58:56,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:56,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343114005] [2021-12-28 05:58:56,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343114005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:56,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:56,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:58:56,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149920526] [2021-12-28 05:58:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:56,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:58:56,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:58:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:58:56,725 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:57,354 INFO L93 Difference]: Finished difference Result 420 states and 456 transitions. [2021-12-28 05:58:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 05:58:57,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 05:58:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:57,355 INFO L225 Difference]: With dead ends: 420 [2021-12-28 05:58:57,355 INFO L226 Difference]: Without dead ends: 420 [2021-12-28 05:58:57,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2021-12-28 05:58:57,356 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 674 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:57,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 1165 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:58:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-12-28 05:58:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 258. [2021-12-28 05:58:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 230 states have (on average 1.3304347826086957) internal successors, (306), 257 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 306 transitions. [2021-12-28 05:58:57,360 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 306 transitions. Word has length 36 [2021-12-28 05:58:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:57,361 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 306 transitions. [2021-12-28 05:58:57,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 306 transitions. [2021-12-28 05:58:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:58:57,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:57,361 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] [2021-12-28 05:58:57,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-28 05:58:57,362 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1529477485, now seen corresponding path program 1 times [2021-12-28 05:58:57,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:57,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456308071] [2021-12-28 05:58:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:57,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:57,416 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-28 05:58:57,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:57,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456308071] [2021-12-28 05:58:57,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456308071] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:57,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:57,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:58:57,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897130712] [2021-12-28 05:58:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:57,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:58:57,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:58:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:58:57,418 INFO L87 Difference]: Start difference. First operand 258 states and 306 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:57,564 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2021-12-28 05:58:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:58:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 05:58:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:57,565 INFO L225 Difference]: With dead ends: 273 [2021-12-28 05:58:57,565 INFO L226 Difference]: Without dead ends: 273 [2021-12-28 05:58:57,565 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-28 05:58:57,566 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 58 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:57,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 516 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-28 05:58:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2021-12-28 05:58:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 266 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 315 transitions. [2021-12-28 05:58:57,569 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 315 transitions. Word has length 36 [2021-12-28 05:58:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:57,569 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 315 transitions. [2021-12-28 05:58:57,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 315 transitions. [2021-12-28 05:58:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:58:57,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:57,569 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] [2021-12-28 05:58:57,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-28 05:58:57,570 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2021-12-28 05:58:57,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:57,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493768236] [2021-12-28 05:58:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:57,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:57,646 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-28 05:58:57,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493768236] [2021-12-28 05:58:57,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493768236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:57,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:57,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:58:57,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28665861] [2021-12-28 05:58:57,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:57,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:58:57,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:57,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:58:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:58:57,648 INFO L87 Difference]: Start difference. First operand 267 states and 315 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:57,916 INFO L93 Difference]: Finished difference Result 267 states and 315 transitions. [2021-12-28 05:58:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:58:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 05:58:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:57,918 INFO L225 Difference]: With dead ends: 267 [2021-12-28 05:58:57,918 INFO L226 Difference]: Without dead ends: 267 [2021-12-28 05:58:57,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-12-28 05:58:57,919 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 75 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:57,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 721 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-12-28 05:58:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2021-12-28 05:58:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3138075313807531) internal successors, (314), 265 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2021-12-28 05:58:57,922 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 36 [2021-12-28 05:58:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:57,922 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2021-12-28 05:58:57,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2021-12-28 05:58:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:58:57,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:57,922 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] [2021-12-28 05:58:57,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-28 05:58:57,922 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2021-12-28 05:58:57,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:57,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835813677] [2021-12-28 05:58:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:57,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:58,018 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-28 05:58:58,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:58,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835813677] [2021-12-28 05:58:58,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835813677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:58,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:58,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:58:58,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829589794] [2021-12-28 05:58:58,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:58,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:58:58,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:58,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:58:58,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:58:58,020 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:58,297 INFO L93 Difference]: Finished difference Result 266 states and 314 transitions. [2021-12-28 05:58:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:58:58,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-28 05:58:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:58,299 INFO L225 Difference]: With dead ends: 266 [2021-12-28 05:58:58,299 INFO L226 Difference]: Without dead ends: 266 [2021-12-28 05:58:58,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-12-28 05:58:58,300 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:58,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 714 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-28 05:58:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2021-12-28 05:58:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 264 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 313 transitions. [2021-12-28 05:58:58,303 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 313 transitions. Word has length 36 [2021-12-28 05:58:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:58,303 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 313 transitions. [2021-12-28 05:58:58,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 313 transitions. [2021-12-28 05:58:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 05:58:58,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:58,303 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-28 05:58:58,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-28 05:58:58,303 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2021-12-28 05:58:58,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:58,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61417493] [2021-12-28 05:58:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:58,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:58,353 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-28 05:58:58,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:58,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61417493] [2021-12-28 05:58:58,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61417493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:58,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:58,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:58:58,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274789106] [2021-12-28 05:58:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:58,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:58:58,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:58:58,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:58:58,354 INFO L87 Difference]: Start difference. First operand 265 states and 313 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:58,486 INFO L93 Difference]: Finished difference Result 275 states and 324 transitions. [2021-12-28 05:58:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:58:58,486 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-28 05:58:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:58,487 INFO L225 Difference]: With dead ends: 275 [2021-12-28 05:58:58,487 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 05:58:58,487 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-28 05:58:58,488 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:58,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 435 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 05:58:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2021-12-28 05:58:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.305084745762712) internal successors, (308), 260 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 308 transitions. [2021-12-28 05:58:58,491 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 308 transitions. Word has length 37 [2021-12-28 05:58:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:58,491 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 308 transitions. [2021-12-28 05:58:58,491 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-28 05:58:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 308 transitions. [2021-12-28 05:58:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 05:58:58,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:58,491 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] [2021-12-28 05:58:58,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-28 05:58:58,491 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:58,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash -886173384, now seen corresponding path program 1 times [2021-12-28 05:58:58,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:58,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227345731] [2021-12-28 05:58:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:58,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:58,508 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-28 05:58:58,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227345731] [2021-12-28 05:58:58,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227345731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:58,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:58,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:58:58,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933685370] [2021-12-28 05:58:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:58,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:58,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:58,510 INFO L87 Difference]: Start difference. First operand 261 states and 308 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:58,537 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2021-12-28 05:58:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:58,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-28 05:58:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:58,538 INFO L225 Difference]: With dead ends: 274 [2021-12-28 05:58:58,538 INFO L226 Difference]: Without dead ends: 274 [2021-12-28 05:58:58,539 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-28 05:58:58,539 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:58,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-12-28 05:58:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2021-12-28 05:58:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.3037974683544304) internal successors, (309), 261 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 309 transitions. [2021-12-28 05:58:58,549 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 309 transitions. Word has length 38 [2021-12-28 05:58:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:58,549 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 309 transitions. [2021-12-28 05:58:58,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 309 transitions. [2021-12-28 05:58:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 05:58:58,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:58,550 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-28 05:58:58,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-28 05:58:58,550 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2021-12-28 05:58:58,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:58,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711327278] [2021-12-28 05:58:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:58,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:58,743 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-28 05:58:58,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711327278] [2021-12-28 05:58:58,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711327278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:58,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:58,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 05:58:58,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691206995] [2021-12-28 05:58:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:58,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:58:58,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:58:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:58:58,745 INFO L87 Difference]: Start difference. First operand 262 states and 309 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:59,318 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2021-12-28 05:58:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 05:58:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-28 05:58:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:59,320 INFO L225 Difference]: With dead ends: 422 [2021-12-28 05:58:59,320 INFO L226 Difference]: Without dead ends: 422 [2021-12-28 05:58:59,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-12-28 05:58:59,320 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 815 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:59,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 1059 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-12-28 05:58:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 262. [2021-12-28 05:58:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 261 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2021-12-28 05:58:59,324 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 39 [2021-12-28 05:58:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:59,325 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2021-12-28 05:58:59,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2021-12-28 05:58:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-28 05:58:59,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:59,325 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-28 05:58:59,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-28 05:58:59,326 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2051878023, now seen corresponding path program 1 times [2021-12-28 05:58:59,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:59,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048288856] [2021-12-28 05:58:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:59,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:59,345 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-28 05:58:59,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:59,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048288856] [2021-12-28 05:58:59,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048288856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:59,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:59,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:59,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022621210] [2021-12-28 05:58:59,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:59,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:59,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:59,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:59,347 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:59,386 INFO L93 Difference]: Finished difference Result 264 states and 309 transitions. [2021-12-28 05:58:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-28 05:58:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:59,387 INFO L225 Difference]: With dead ends: 264 [2021-12-28 05:58:59,388 INFO L226 Difference]: Without dead ends: 264 [2021-12-28 05:58:59,388 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-28 05:58:59,389 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:59,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 159 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-28 05:58:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2021-12-28 05:58:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 259 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2021-12-28 05:58:59,393 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 41 [2021-12-28 05:58:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:59,393 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2021-12-28 05:58:59,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2021-12-28 05:58:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-28 05:58:59,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:59,394 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] [2021-12-28 05:58:59,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-28 05:58:59,394 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:58:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1173136884, now seen corresponding path program 1 times [2021-12-28 05:58:59,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:59,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140331143] [2021-12-28 05:58:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:59,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:59,516 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-28 05:58:59,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140331143] [2021-12-28 05:58:59,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140331143] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:58:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192658871] [2021-12-28 05:58:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:59,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:59,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:59,518 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-28 05:58:59,519 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-28 05:58:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:59,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 05:58:59,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:59,614 INFO L387 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-28 05:58:59,617 INFO L387 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-28 05:58:59,652 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:58:59,652 INFO L387 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-28 05:58:59,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:59,668 INFO L387 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-28 05:58:59,751 INFO L387 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-28 05:58:59,754 INFO L387 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-28 05:58:59,769 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-28 05:58:59,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:58:59,887 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-28 05:58:59,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192658871] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:58:59,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:58:59,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-28 05:58:59,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704256147] [2021-12-28 05:58:59,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:58:59,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:58:59,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:58:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:58:59,889 INFO L87 Difference]: Start difference. First operand 260 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:00,182 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-12-28 05:59:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:59:00,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-28 05:59:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:00,183 INFO L225 Difference]: With dead ends: 352 [2021-12-28 05:59:00,184 INFO L226 Difference]: Without dead ends: 352 [2021-12-28 05:59:00,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-28 05:59:00,184 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:00,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 802 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:59:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-12-28 05:59:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2021-12-28 05:59:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 283 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 339 transitions. [2021-12-28 05:59:00,188 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 339 transitions. Word has length 41 [2021-12-28 05:59:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:00,188 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 339 transitions. [2021-12-28 05:59:00,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 339 transitions. [2021-12-28 05:59:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:59:00,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:00,189 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-28 05:59:00,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:59:00,398 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,SelfDestructingSolverStorable32 [2021-12-28 05:59:00,399 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash 816295160, now seen corresponding path program 1 times [2021-12-28 05:59:00,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:00,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942078976] [2021-12-28 05:59:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:00,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:00,481 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-28 05:59:00,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:00,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942078976] [2021-12-28 05:59:00,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942078976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:00,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:00,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:59:00,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272270067] [2021-12-28 05:59:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:00,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:59:00,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:00,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:59:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:59:00,483 INFO L87 Difference]: Start difference. First operand 284 states and 339 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:00,747 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2021-12-28 05:59:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:59:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-28 05:59:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:00,748 INFO L225 Difference]: With dead ends: 348 [2021-12-28 05:59:00,748 INFO L226 Difference]: Without dead ends: 348 [2021-12-28 05:59:00,749 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-28 05:59:00,749 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 405 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:00,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 498 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:59:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-28 05:59:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2021-12-28 05:59:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 267 states have (on average 1.303370786516854) internal successors, (348), 290 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2021-12-28 05:59:00,753 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 42 [2021-12-28 05:59:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:00,753 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2021-12-28 05:59:00,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2021-12-28 05:59:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:59:00,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:00,754 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-28 05:59:00,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-28 05:59:00,754 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash 816295161, now seen corresponding path program 1 times [2021-12-28 05:59:00,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:00,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396431947] [2021-12-28 05:59:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:00,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:00,856 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-28 05:59:00,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:00,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396431947] [2021-12-28 05:59:00,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396431947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:00,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:00,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:59:00,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266257464] [2021-12-28 05:59:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:00,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:59:00,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:00,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:59:00,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:59:00,859 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:01,192 INFO L93 Difference]: Finished difference Result 348 states and 397 transitions. [2021-12-28 05:59:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:59:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-28 05:59:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:01,193 INFO L225 Difference]: With dead ends: 348 [2021-12-28 05:59:01,193 INFO L226 Difference]: Without dead ends: 348 [2021-12-28 05:59:01,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:59:01,194 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 248 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:01,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 632 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:59:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-12-28 05:59:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2021-12-28 05:59:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.3003663003663004) internal successors, (355), 296 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2021-12-28 05:59:01,198 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 355 transitions. Word has length 42 [2021-12-28 05:59:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:01,198 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 355 transitions. [2021-12-28 05:59:01,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 355 transitions. [2021-12-28 05:59:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:59:01,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:01,199 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-28 05:59:01,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-28 05:59:01,199 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2007506213, now seen corresponding path program 1 times [2021-12-28 05:59:01,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:01,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367462033] [2021-12-28 05:59:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:01,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:01,227 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-28 05:59:01,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367462033] [2021-12-28 05:59:01,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367462033] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:59:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879506954] [2021-12-28 05:59:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:01,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:59:01,229 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-28 05:59:01,230 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-28 05:59:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:01,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:59:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:59:01,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 05:59:01,397 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-28 05:59:01,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:59:01,453 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-28 05:59:01,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879506954] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:59:01,453 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:59:01,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-28 05:59:01,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169023018] [2021-12-28 05:59:01,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:59:01,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:59:01,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:59:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:59:01,455 INFO L87 Difference]: Start difference. First operand 297 states and 355 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:01,528 INFO L93 Difference]: Finished difference Result 328 states and 386 transitions. [2021-12-28 05:59:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:59:01,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-28 05:59:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:01,530 INFO L225 Difference]: With dead ends: 328 [2021-12-28 05:59:01,530 INFO L226 Difference]: Without dead ends: 304 [2021-12-28 05:59:01,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:59:01,531 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:01,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2021-12-28 05:59:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-28 05:59:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2021-12-28 05:59:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 1.292857142857143) internal successors, (362), 303 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 362 transitions. [2021-12-28 05:59:01,537 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 362 transitions. Word has length 42 [2021-12-28 05:59:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:01,537 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 362 transitions. [2021-12-28 05:59:01,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 362 transitions. [2021-12-28 05:59:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:59:01,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:01,538 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] [2021-12-28 05:59:01,557 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-28 05:59:01,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:01,747 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1167718218, now seen corresponding path program 1 times [2021-12-28 05:59:01,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:01,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102269966] [2021-12-28 05:59:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:01,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:01,768 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-28 05:59:01,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:01,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102269966] [2021-12-28 05:59:01,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102269966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:01,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:01,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:59:01,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908261860] [2021-12-28 05:59:01,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:01,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:59:01,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:01,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:59:01,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:59:01,771 INFO L87 Difference]: Start difference. First operand 304 states and 362 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:01,778 INFO L93 Difference]: Finished difference Result 458 states and 556 transitions. [2021-12-28 05:59:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:59:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-28 05:59:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:01,779 INFO L225 Difference]: With dead ends: 458 [2021-12-28 05:59:01,779 INFO L226 Difference]: Without dead ends: 458 [2021-12-28 05:59:01,780 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-28 05:59:01,780 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 54 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:01,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:59:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-12-28 05:59:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 340. [2021-12-28 05:59:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3259493670886076) internal successors, (419), 339 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 419 transitions. [2021-12-28 05:59:01,785 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 419 transitions. Word has length 44 [2021-12-28 05:59:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:01,785 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 419 transitions. [2021-12-28 05:59:01,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 419 transitions. [2021-12-28 05:59:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:59:01,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:01,787 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] [2021-12-28 05:59:01,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-28 05:59:01,787 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1519355336, now seen corresponding path program 1 times [2021-12-28 05:59:01,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:01,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999526701] [2021-12-28 05:59:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:01,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:01,926 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-28 05:59:01,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:01,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999526701] [2021-12-28 05:59:01,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999526701] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:01,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:01,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:59:01,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749664063] [2021-12-28 05:59:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:01,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:59:01,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:01,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:59:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:59:01,929 INFO L87 Difference]: Start difference. First operand 340 states and 419 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:02,189 INFO L93 Difference]: Finished difference Result 370 states and 439 transitions. [2021-12-28 05:59:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:59:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-28 05:59:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:02,190 INFO L225 Difference]: With dead ends: 370 [2021-12-28 05:59:02,190 INFO L226 Difference]: Without dead ends: 370 [2021-12-28 05:59:02,190 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-28 05:59:02,190 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:02,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 514 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:59:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-28 05:59:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2021-12-28 05:59:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 316 states have (on average 1.3227848101265822) internal successors, (418), 339 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 418 transitions. [2021-12-28 05:59:02,194 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 418 transitions. Word has length 44 [2021-12-28 05:59:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:02,195 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 418 transitions. [2021-12-28 05:59:02,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 418 transitions. [2021-12-28 05:59:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 05:59:02,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:02,195 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] [2021-12-28 05:59:02,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-28 05:59:02,196 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1190454621, now seen corresponding path program 1 times [2021-12-28 05:59:02,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:02,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18137934] [2021-12-28 05:59:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:02,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:02,239 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-28 05:59:02,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18137934] [2021-12-28 05:59:02,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18137934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:02,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:02,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:59:02,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796899689] [2021-12-28 05:59:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:02,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:59:02,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:59:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:59:02,241 INFO L87 Difference]: Start difference. First operand 340 states and 418 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:02,306 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2021-12-28 05:59:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:59:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-28 05:59:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:02,307 INFO L225 Difference]: With dead ends: 287 [2021-12-28 05:59:02,307 INFO L226 Difference]: Without dead ends: 287 [2021-12-28 05:59:02,308 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-28 05:59:02,309 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:02,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:59:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-28 05:59:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2021-12-28 05:59:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 263 states have (on average 1.2509505703422052) internal successors, (329), 285 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2021-12-28 05:59:02,313 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 46 [2021-12-28 05:59:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:02,313 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2021-12-28 05:59:02,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2021-12-28 05:59:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-28 05:59:02,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:02,314 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] [2021-12-28 05:59:02,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-28 05:59:02,315 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 120277254, now seen corresponding path program 1 times [2021-12-28 05:59:02,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:02,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77040631] [2021-12-28 05:59:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:02,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:02,391 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-28 05:59:02,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:02,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77040631] [2021-12-28 05:59:02,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77040631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:02,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:02,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:59:02,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875606846] [2021-12-28 05:59:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:02,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:59:02,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:59:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:59:02,394 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:02,677 INFO L93 Difference]: Finished difference Result 279 states and 317 transitions. [2021-12-28 05:59:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:59:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-12-28 05:59:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:02,678 INFO L225 Difference]: With dead ends: 279 [2021-12-28 05:59:02,678 INFO L226 Difference]: Without dead ends: 279 [2021-12-28 05:59:02,678 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-28 05:59:02,678 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 406 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:02,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 639 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:59:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-28 05:59:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2021-12-28 05:59:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 262 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 304 transitions. [2021-12-28 05:59:02,681 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 304 transitions. Word has length 49 [2021-12-28 05:59:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:02,682 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 304 transitions. [2021-12-28 05:59:02,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 304 transitions. [2021-12-28 05:59:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-28 05:59:02,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:02,682 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] [2021-12-28 05:59:02,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-28 05:59:02,683 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1590511077, now seen corresponding path program 1 times [2021-12-28 05:59:02,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:02,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790188904] [2021-12-28 05:59:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:02,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:59:02,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:02,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790188904] [2021-12-28 05:59:02,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790188904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:59:02,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:59:02,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:59:02,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810601803] [2021-12-28 05:59:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:59:02,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:59:02,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:59:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:59:02,717 INFO L87 Difference]: Start difference. First operand 263 states and 304 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:02,782 INFO L93 Difference]: Finished difference Result 277 states and 318 transitions. [2021-12-28 05:59:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:59:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-12-28 05:59:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:02,783 INFO L225 Difference]: With dead ends: 277 [2021-12-28 05:59:02,783 INFO L226 Difference]: Without dead ends: 277 [2021-12-28 05:59:02,783 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-28 05:59:02,783 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 19 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:02,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 474 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:59:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-28 05:59:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2021-12-28 05:59:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 265 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2021-12-28 05:59:02,787 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 50 [2021-12-28 05:59:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:02,788 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2021-12-28 05:59:02,788 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-28 05:59:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2021-12-28 05:59:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 05:59:02,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:02,788 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] [2021-12-28 05:59:02,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-28 05:59:02,789 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash -97333738, now seen corresponding path program 1 times [2021-12-28 05:59:02,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:02,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135174258] [2021-12-28 05:59:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:02,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:02,888 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-28 05:59:02,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:02,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135174258] [2021-12-28 05:59:02,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135174258] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:59:02,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258704211] [2021-12-28 05:59:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:02,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:02,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:59:02,890 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-28 05:59:02,891 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-28 05:59:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:02,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-28 05:59:02,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:59:03,002 INFO L387 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-28 05:59:03,099 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:59:03,099 INFO L387 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-28 05:59:03,127 INFO L387 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-28 05:59:03,214 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:03,214 INFO L387 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-28 05:59:03,274 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:03,274 INFO L387 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-28 05:59:03,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:03,429 INFO L387 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-28 05:59:03,476 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-28 05:59:03,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:59:03,834 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:03,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-28 05:59:03,841 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:03,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-28 05:59:03,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-28 05:59:05,293 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-28 05:59:05,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258704211] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:59:05,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:59:05,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-28 05:59:05,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371289220] [2021-12-28 05:59:05,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:59:05,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 05:59:05,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 05:59:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=734, Unknown=8, NotChecked=0, Total=870 [2021-12-28 05:59:05,294 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:05,882 INFO L93 Difference]: Finished difference Result 432 states and 473 transitions. [2021-12-28 05:59:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:59:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-28 05:59:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:05,883 INFO L225 Difference]: With dead ends: 432 [2021-12-28 05:59:05,883 INFO L226 Difference]: Without dead ends: 432 [2021-12-28 05:59:05,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1134, Unknown=8, NotChecked=0, Total=1406 [2021-12-28 05:59:05,884 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 879 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 881 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:05,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 1592 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1044 Invalid, 0 Unknown, 881 Unchecked, 0.4s Time] [2021-12-28 05:59:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-12-28 05:59:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 312. [2021-12-28 05:59:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 311 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2021-12-28 05:59:05,888 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 52 [2021-12-28 05:59:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:05,888 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2021-12-28 05:59:05,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.206896551724138) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2021-12-28 05:59:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 05:59:05,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:05,889 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] [2021-12-28 05:59:05,909 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-28 05:59:06,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:06,107 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -97333737, now seen corresponding path program 1 times [2021-12-28 05:59:06,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:06,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188305975] [2021-12-28 05:59:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:06,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:06,249 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-28 05:59:06,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188305975] [2021-12-28 05:59:06,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188305975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:59:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701095299] [2021-12-28 05:59:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:06,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:59:06,251 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-28 05:59:06,252 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-28 05:59:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:06,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-28 05:59:06,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:59:06,377 INFO L387 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-28 05:59:06,459 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:59:06,460 INFO L387 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-28 05:59:06,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:59:06,490 INFO L387 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-28 05:59:06,496 INFO L387 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-28 05:59:06,600 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:59:06,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-28 05:59:06,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-28 05:59:06,615 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:06,615 INFO L387 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-28 05:59:06,697 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:06,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-28 05:59:06,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-28 05:59:06,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:06,916 INFO L387 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-28 05:59:06,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:06,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:59:06,958 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-28 05:59:06,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:59:07,710 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:07,711 INFO L387 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 58 treesize of output 51 [2021-12-28 05:59:07,716 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:07,716 INFO L387 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 51 treesize of output 51 [2021-12-28 05:59:07,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:07,726 INFO L387 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 74 treesize of output 77 [2021-12-28 05:59:07,733 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:07,733 INFO L387 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 125 treesize of output 120 [2021-12-28 05:59:07,739 INFO L387 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 89 treesize of output 85 [2021-12-28 05:59:07,743 INFO L387 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 85 treesize of output 81 [2021-12-28 05:59:07,746 INFO L387 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 81 treesize of output 79 [2021-12-28 05:59:08,219 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-28 05:59:08,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701095299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:59:08,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:59:08,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-28 05:59:08,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353230556] [2021-12-28 05:59:08,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:59:08,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-28 05:59:08,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-28 05:59:08,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=889, Unknown=7, NotChecked=0, Total=992 [2021-12-28 05:59:08,221 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:09,740 INFO L93 Difference]: Finished difference Result 464 states and 507 transitions. [2021-12-28 05:59:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-28 05:59:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-28 05:59:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:09,742 INFO L225 Difference]: With dead ends: 464 [2021-12-28 05:59:09,742 INFO L226 Difference]: Without dead ends: 464 [2021-12-28 05:59:09,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=2532, Unknown=7, NotChecked=0, Total=2970 [2021-12-28 05:59:09,743 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 1003 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 732 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:09,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1003 Valid, 1830 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1555 Invalid, 0 Unknown, 732 Unchecked, 0.6s Time] [2021-12-28 05:59:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-12-28 05:59:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 329. [2021-12-28 05:59:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.261437908496732) internal successors, (386), 328 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 386 transitions. [2021-12-28 05:59:09,747 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 386 transitions. Word has length 52 [2021-12-28 05:59:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:09,748 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 386 transitions. [2021-12-28 05:59:09,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.967741935483871) internal successors, (154), 32 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 386 transitions. [2021-12-28 05:59:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 05:59:09,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:09,748 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, 1] [2021-12-28 05:59:09,775 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-28 05:59:09,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:09,964 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299753, now seen corresponding path program 1 times [2021-12-28 05:59:09,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:09,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929516769] [2021-12-28 05:59:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:09,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:10,227 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-28 05:59:10,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:10,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929516769] [2021-12-28 05:59:10,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929516769] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:59:10,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659395202] [2021-12-28 05:59:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:10,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:59:10,228 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-28 05:59:10,255 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-28 05:59:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:10,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-28 05:59:10,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:59:10,366 INFO L387 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-28 05:59:10,391 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:59:10,392 INFO L387 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-28 05:59:10,420 INFO L387 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-28 05:59:10,470 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:10,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 05:59:10,531 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:10,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 05:59:10,640 INFO L353 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-28 05:59:10,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-28 05:59:10,697 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 05:59:10,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2021-12-28 05:59:11,052 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:11,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2021-12-28 05:59:11,696 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:11,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-28 05:59:12,834 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:12,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2021-12-28 05:59:15,491 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-28 05:59:15,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:59:15,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2021-12-28 05:59:15,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1)) is different from false [2021-12-28 05:59:18,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2021-12-28 05:59:18,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|))) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) 0)))) is different from false [2021-12-28 05:59:19,286 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:19,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 66 [2021-12-28 05:59:19,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:19,291 INFO L387 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 246 treesize of output 232 [2021-12-28 05:59:19,294 INFO L387 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 244 treesize of output 236 [2021-12-28 05:59:19,300 INFO L387 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 250 treesize of output 222 [2021-12-28 05:59:19,304 INFO L387 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 188 treesize of output 164 [2021-12-28 05:59:19,671 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-28 05:59:19,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659395202] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:59:19,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:59:19,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 17] total 42 [2021-12-28 05:59:19,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39009835] [2021-12-28 05:59:19,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:59:19,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-28 05:59:19,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-28 05:59:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1239, Unknown=36, NotChecked=308, Total=1806 [2021-12-28 05:59:19,673 INFO L87 Difference]: Start difference. First operand 329 states and 386 transitions. Second operand has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:24,441 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1236 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1236) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) 1))) is different from false [2021-12-28 05:59:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:28,729 INFO L93 Difference]: Finished difference Result 499 states and 576 transitions. [2021-12-28 05:59:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-28 05:59:28,729 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-28 05:59:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:28,731 INFO L225 Difference]: With dead ends: 499 [2021-12-28 05:59:28,731 INFO L226 Difference]: Without dead ends: 499 [2021-12-28 05:59:28,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=445, Invalid=2491, Unknown=54, NotChecked=550, Total=3540 [2021-12-28 05:59:28,732 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 545 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2112 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:28,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 2338 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 859 Invalid, 0 Unknown, 2112 Unchecked, 0.4s Time] [2021-12-28 05:59:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-12-28 05:59:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 361. [2021-12-28 05:59:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 360 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 421 transitions. [2021-12-28 05:59:28,736 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 421 transitions. Word has length 55 [2021-12-28 05:59:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:28,736 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 421 transitions. [2021-12-28 05:59:28,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 43 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 421 transitions. [2021-12-28 05:59:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 05:59:28,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:28,737 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, 1] [2021-12-28 05:59:28,757 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-28 05:59:28,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:28,951 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2084299754, now seen corresponding path program 1 times [2021-12-28 05:59:28,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:28,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568594735] [2021-12-28 05:59:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:28,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:29,316 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-28 05:59:29,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:29,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568594735] [2021-12-28 05:59:29,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568594735] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:59:29,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618303197] [2021-12-28 05:59:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:29,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:59:29,317 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-28 05:59:29,318 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-28 05:59:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:29,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-28 05:59:29,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:59:29,449 INFO L387 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-28 05:59:29,484 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:59:29,484 INFO L387 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-28 05:59:29,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:59:29,525 INFO L387 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-28 05:59:29,530 INFO L387 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-28 05:59:29,588 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:29,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2021-12-28 05:59:29,592 INFO L387 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-28 05:59:29,664 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:29,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2021-12-28 05:59:29,669 INFO L387 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-28 05:59:29,830 INFO L353 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-28 05:59:29,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-28 05:59:29,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-28 05:59:29,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:29,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-12-28 05:59:29,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:29,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:59:30,062 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:30,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-28 05:59:30,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:30,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-28 05:59:30,251 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:30,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2021-12-28 05:59:30,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-12-28 05:59:30,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:30,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-28 05:59:30,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:30,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:30,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2021-12-28 05:59:30,588 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-28 05:59:30,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:59:30,739 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4)))) is different from false [2021-12-28 05:59:30,795 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) is different from false [2021-12-28 05:59:30,803 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 4))) (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2021-12-28 05:59:30,815 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1351 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) (forall ((v_ArrVal_1351 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_#t~malloc10#1.offset|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1351) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))))) is different from false [2021-12-28 05:59:36,074 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:36,075 INFO L387 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 277 treesize of output 248 [2021-12-28 05:59:36,082 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:36,082 INFO L387 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 248 treesize of output 178 [2021-12-28 05:59:36,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,091 INFO L387 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 734 treesize of output 700 [2021-12-28 05:59:36,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,106 INFO L387 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 2210 treesize of output 2178 [2021-12-28 05:59:36,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,122 INFO L387 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 2133 treesize of output 2069 [2021-12-28 05:59:36,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,132 INFO L387 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 2033 treesize of output 1885 [2021-12-28 05:59:36,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,146 INFO L387 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 1768 treesize of output 1672 [2021-12-28 05:59:36,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,155 INFO L387 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 1636 treesize of output 1588 [2021-12-28 05:59:36,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,171 INFO L387 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 1516 treesize of output 1420 [2021-12-28 05:59:36,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,179 INFO L387 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 1384 treesize of output 1224 [2021-12-28 05:59:36,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,191 INFO L387 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 1206 treesize of output 1182 [2021-12-28 05:59:36,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:36,200 INFO L387 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 1173 treesize of output 1161 [2021-12-28 05:59:36,210 INFO L387 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 1161 treesize of output 1137 [2021-12-28 05:59:39,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:39,259 INFO L387 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 55 treesize of output 53 [2021-12-28 05:59:39,332 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-28 05:59:39,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618303197] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:59:39,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:59:39,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 42 [2021-12-28 05:59:39,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553654746] [2021-12-28 05:59:39,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:59:39,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-28 05:59:39,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-28 05:59:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1267, Unknown=26, NotChecked=308, Total=1806 [2021-12-28 05:59:39,334 INFO L87 Difference]: Start difference. First operand 361 states and 421 transitions. Second operand has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:59:40,374 INFO L93 Difference]: Finished difference Result 418 states and 470 transitions. [2021-12-28 05:59:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 05:59:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-28 05:59:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:59:40,375 INFO L225 Difference]: With dead ends: 418 [2021-12-28 05:59:40,375 INFO L226 Difference]: Without dead ends: 418 [2021-12-28 05:59:40,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=330, Invalid=2012, Unknown=26, NotChecked=388, Total=2756 [2021-12-28 05:59:40,376 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 281 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1202 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:59:40,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 2802 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1050 Invalid, 0 Unknown, 1202 Unchecked, 0.5s Time] [2021-12-28 05:59:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-12-28 05:59:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 360. [2021-12-28 05:59:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 338 states have (on average 1.227810650887574) internal successors, (415), 359 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 415 transitions. [2021-12-28 05:59:40,382 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 415 transitions. Word has length 55 [2021-12-28 05:59:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:59:40,382 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 415 transitions. [2021-12-28 05:59:40,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 43 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:59:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 415 transitions. [2021-12-28 05:59:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 05:59:40,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:59:40,383 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, 1] [2021-12-28 05:59:40,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:59:40,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:40,596 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 75 more)] === [2021-12-28 05:59:40,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:59:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1738644409, now seen corresponding path program 1 times [2021-12-28 05:59:40,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:59:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845150632] [2021-12-28 05:59:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:40,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:59:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:41,018 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-28 05:59:41,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:59:41,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845150632] [2021-12-28 05:59:41,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845150632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:59:41,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777742069] [2021-12-28 05:59:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:59:41,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:59:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:59:41,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:59:41,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 05:59:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:59:41,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-28 05:59:41,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:59:41,160 INFO L387 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-28 05:59:41,183 INFO L387 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-28 05:59:41,187 INFO L387 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-28 05:59:41,295 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:59:41,295 INFO L387 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-28 05:59:41,350 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 05:59:41,350 INFO L387 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-28 05:59:41,364 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-28 05:59:41,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:59:41,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:41,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-28 05:59:41,586 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:59:41,587 INFO L387 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-28 05:59:41,832 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-28 05:59:41,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-12-28 05:59:41,918 INFO L353 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-12-28 05:59:41,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2021-12-28 05:59:41,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:59:41,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-28 05:59:42,131 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-28 05:59:42,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 75 [2021-12-28 05:59:42,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-28 05:59:42,325 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-28 05:59:42,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 82 [2021-12-28 05:59:42,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2021-12-28 05:59:42,975 INFO L353 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2021-12-28 05:59:42,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 39 [2021-12-28 05:59:42,981 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 05:59:42,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-28 05:59:43,091 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-28 05:59:43,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:59:43,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (and (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-28 05:59:43,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1466) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0))))) is different from false [2021-12-28 05:59:43,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1465) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-28 05:59:43,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse4 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse4) v_ArrVal_1464))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) .cse4) v_ArrVal_1466))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int))) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1465) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1467))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0))))) is different from false [2021-12-28 05:59:43,429 INFO L353 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2021-12-28 05:59:43,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 52 [2021-12-28 05:59:43,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse3 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) .cse3) v_ArrVal_1466))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1465) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base|)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) .cse1)) v_ArrVal_1467) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (= .cse0 0))))) is different from false [2021-12-28 05:59:44,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:44,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 100 [2021-12-28 05:59:44,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse3 (select v_arrayElimArr_7 .cse5))) (let ((.cse0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_7) .cse3 v_ArrVal_1464))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) .cse5) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (and (= .cse0 0) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse2 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (select v_arrayElimArr_7 .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1465) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_7) .cse1 v_ArrVal_1464) |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1467))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) (not (= 0 (select |c_#valid| .cse3))) (= .cse0 |c_ULTIMATE.start_main_~end~0#1.base|)))))) is different from false [2021-12-28 05:59:44,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse5 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_7 .cse5))) (let ((.cse1 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_1464))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_#t~mem11#1.base|) .cse5) v_ArrVal_1466)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (or (not (= 0 (select |c_#valid| .cse0))) (= |c_ULTIMATE.start_main_#t~mem11#1.base| .cse1) (and (= 0 .cse1) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse3 (+ 4 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_7 .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1462) .cse2 v_ArrVal_1465) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_arrayElimArr_7) .cse2 v_ArrVal_1464) |c_ULTIMATE.start_main_#t~mem11#1.base|) .cse3) v_ArrVal_1467))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)))))))) is different from false [2021-12-28 05:59:46,576 INFO L353 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-28 05:59:46,577 INFO L387 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 194 treesize of output 154 [2021-12-28 05:59:46,591 INFO L353 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-28 05:59:46,591 INFO L387 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 154 treesize of output 159 [2021-12-28 05:59:46,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:46,598 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-28 05:59:46,599 INFO L387 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 245 treesize of output 229 [2021-12-28 05:59:46,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:46,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:59:46,608 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:46,608 INFO L387 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 156 treesize of output 144 [2021-12-28 05:59:46,615 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:59:46,615 INFO L387 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 157 treesize of output 141 [2021-12-28 05:59:46,622 INFO L387 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 63 treesize of output 59 [2021-12-28 05:59:46,626 INFO L387 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 59 treesize of output 51 [2021-12-28 05:59:46,728 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-28 05:59:46,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777742069] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:59:46,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:59:46,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19] total 51 [2021-12-28 05:59:46,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663039448] [2021-12-28 05:59:46,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:59:46,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-28 05:59:46,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:59:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-28 05:59:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1685, Unknown=13, NotChecked=630, Total=2550 [2021-12-28 05:59:46,729 INFO L87 Difference]: Start difference. First operand 360 states and 415 transitions. Second operand has 51 states, 51 states have (on average 2.9607843137254903) internal successors, (151), 51 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)