./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 06:00:46,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 06:00:46,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 06:00:46,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 06:00:46,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 06:00:46,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 06:00:46,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 06:00:46,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 06:00:46,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 06:00:46,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 06:00:46,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 06:00:46,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 06:00:46,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 06:00:46,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 06:00:46,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 06:00:46,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 06:00:46,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 06:00:46,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 06:00:46,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 06:00:46,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 06:00:46,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 06:00:46,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 06:00:46,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 06:00:46,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 06:00:46,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 06:00:46,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 06:00:46,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 06:00:46,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 06:00:46,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 06:00:46,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 06:00:46,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 06:00:46,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 06:00:46,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 06:00:46,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 06:00:46,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 06:00:46,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 06:00:46,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 06:00:46,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 06:00:46,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 06:00:46,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 06:00:46,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 06:00:46,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 06:00:46,582 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 06:00:46,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 06:00:46,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 06:00:46,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 06:00:46,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 06:00:46,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 06:00:46,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 06:00:46,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 06:00:46,586 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 06:00:46,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 06:00:46,586 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 06:00:46,587 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 06:00:46,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 06:00:46,588 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 06:00:46,588 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 06:00:46,588 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 06:00:46,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 06:00:46,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 06:00:46,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 06:00:46,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:00:46,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 06:00:46,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 06:00:46,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 06:00:46,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 06:00:46,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 06:00:46,590 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-12-16 06:00:46,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 06:00:46,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 06:00:46,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 06:00:46,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 06:00:46,798 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 06:00:46,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-12-16 06:00:46,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a64f2247/7d5955a9b1c74ce388836b958626bd30/FLAGa826f48ac [2021-12-16 06:00:47,265 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 06:00:47,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-12-16 06:00:47,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a64f2247/7d5955a9b1c74ce388836b958626bd30/FLAGa826f48ac [2021-12-16 06:00:47,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a64f2247/7d5955a9b1c74ce388836b958626bd30 [2021-12-16 06:00:47,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 06:00:47,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 06:00:47,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 06:00:47,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 06:00:47,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 06:00:47,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4657a4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47, skipping insertion in model container [2021-12-16 06:00:47,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 06:00:47,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 06:00:47,524 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-2.i[22034,22047] [2021-12-16 06:00:47,532 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-2.i[22307,22320] [2021-12-16 06:00:47,536 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-2.i[22516,22529] [2021-12-16 06:00:47,537 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-2.i[22586,22599] [2021-12-16 06:00:47,541 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-2.i[22853,22866] [2021-12-16 06:00:47,542 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-2.i[22961,22974] [2021-12-16 06:00:47,543 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-2.i[23192,23205] [2021-12-16 06:00:47,545 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-2.i[23272,23285] [2021-12-16 06:00:47,546 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-2.i[23351,23364] [2021-12-16 06:00:47,547 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-2.i[23484,23497] [2021-12-16 06:00:47,548 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-2.i[23662,23675] [2021-12-16 06:00:47,549 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-2.i[23740,23753] [2021-12-16 06:00:47,550 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-2.i[23817,23830] [2021-12-16 06:00:47,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:00:47,566 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 06:00:47,593 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-2.i[22034,22047] [2021-12-16 06:00:47,603 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-2.i[22307,22320] [2021-12-16 06:00:47,606 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-2.i[22516,22529] [2021-12-16 06:00:47,606 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-2.i[22586,22599] [2021-12-16 06:00:47,608 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-2.i[22853,22866] [2021-12-16 06:00:47,609 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-2.i[22961,22974] [2021-12-16 06:00:47,610 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-2.i[23192,23205] [2021-12-16 06:00:47,610 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-2.i[23272,23285] [2021-12-16 06:00:47,610 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-2.i[23351,23364] [2021-12-16 06:00:47,612 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-2.i[23484,23497] [2021-12-16 06:00:47,613 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-2.i[23662,23675] [2021-12-16 06:00:47,614 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-2.i[23740,23753] [2021-12-16 06:00:47,614 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-2.i[23817,23830] [2021-12-16 06:00:47,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:00:47,635 INFO L208 MainTranslator]: Completed translation [2021-12-16 06:00:47,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47 WrapperNode [2021-12-16 06:00:47,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 06:00:47,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 06:00:47,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 06:00:47,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 06:00:47,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,710 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2021-12-16 06:00:47,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 06:00:47,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 06:00:47,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 06:00:47,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 06:00:47,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 06:00:47,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 06:00:47,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 06:00:47,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 06:00:47,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (1/1) ... [2021-12-16 06:00:47,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:00:47,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:47,769 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-16 06:00:47,786 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-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 06:00:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 06:00:47,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 06:00:47,872 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 06:00:47,873 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 06:00:48,196 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 06:00:48,205 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 06:00:48,206 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-16 06:00:48,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:48 BoogieIcfgContainer [2021-12-16 06:00:48,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 06:00:48,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 06:00:48,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 06:00:48,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 06:00:48,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:00:47" (1/3) ... [2021-12-16 06:00:48,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16394522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:48, skipping insertion in model container [2021-12-16 06:00:48,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:00:47" (2/3) ... [2021-12-16 06:00:48,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16394522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:00:48, skipping insertion in model container [2021-12-16 06:00:48,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:48" (3/3) ... [2021-12-16 06:00:48,214 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-12-16 06:00:48,218 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 06:00:48,218 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-12-16 06:00:48,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 06:00:48,249 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-16 06:00:48,249 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-12-16 06:00:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:00:48,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:48,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:00:48,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-16 06:00:48,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:48,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7362717] [2021-12-16 06:00:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:48,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:48,384 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-16 06:00:48,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:48,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7362717] [2021-12-16 06:00:48,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7362717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:48,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:48,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:48,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495214080] [2021-12-16 06:00:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:48,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:48,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:48,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:48,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:48,429 INFO L87 Difference]: Start difference. First operand has 195 states, 114 states have (on average 2.175438596491228) internal successors, (248), 194 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:48,588 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2021-12-16 06:00:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:48,590 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-16 06:00:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:48,598 INFO L225 Difference]: With dead ends: 197 [2021-12-16 06:00:48,598 INFO L226 Difference]: Without dead ends: 193 [2021-12-16 06:00:48,599 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-16 06:00:48,604 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 188 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:48,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 123 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-16 06:00:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-12-16 06:00:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 187 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2021-12-16 06:00:48,662 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 3 [2021-12-16 06:00:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:48,662 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2021-12-16 06:00:48,662 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-16 06:00:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2021-12-16 06:00:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 06:00:48,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:48,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 06:00:48,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 06:00:48,663 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-16 06:00:48,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:48,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987270814] [2021-12-16 06:00:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:48,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:48,691 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-16 06:00:48,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987270814] [2021-12-16 06:00:48,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987270814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:48,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:48,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:48,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233315414] [2021-12-16 06:00:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:48,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:48,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:48,693 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:48,818 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2021-12-16 06:00:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:48,819 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-16 06:00:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:48,822 INFO L225 Difference]: With dead ends: 218 [2021-12-16 06:00:48,827 INFO L226 Difference]: Without dead ends: 218 [2021-12-16 06:00:48,827 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-16 06:00:48,828 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 178 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:48,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 149 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-16 06:00:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2021-12-16 06:00:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.669172932330827) internal successors, (222), 197 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2021-12-16 06:00:48,835 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 3 [2021-12-16 06:00:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:48,836 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2021-12-16 06:00:48,836 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-16 06:00:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2021-12-16 06:00:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 06:00:48,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:48,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 06:00:48,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 06:00:48,837 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash 28691969, now seen corresponding path program 1 times [2021-12-16 06:00:48,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033680031] [2021-12-16 06:00:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:48,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:48,867 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-16 06:00:48,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033680031] [2021-12-16 06:00:48,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033680031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:48,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:48,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:48,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114317308] [2021-12-16 06:00:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:48,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:48,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:48,869 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:48,892 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2021-12-16 06:00:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:48,892 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-16 06:00:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:48,893 INFO L225 Difference]: With dead ends: 213 [2021-12-16 06:00:48,893 INFO L226 Difference]: Without dead ends: 213 [2021-12-16 06:00:48,894 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-16 06:00:48,895 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 175 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:48,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-16 06:00:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2021-12-16 06:00:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.6590909090909092) internal successors, (219), 195 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 219 transitions. [2021-12-16 06:00:48,902 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 219 transitions. Word has length 5 [2021-12-16 06:00:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:48,902 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 219 transitions. [2021-12-16 06:00:48,902 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-16 06:00:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2021-12-16 06:00:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 06:00:48,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:48,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:48,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 06:00:48,903 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -618617197, now seen corresponding path program 1 times [2021-12-16 06:00:48,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735853393] [2021-12-16 06:00:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:48,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:48,948 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-16 06:00:48,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:48,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735853393] [2021-12-16 06:00:48,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735853393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:48,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:48,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:48,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995693818] [2021-12-16 06:00:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:48,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:48,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:48,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:48,950 INFO L87 Difference]: Start difference. First operand 196 states and 219 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,071 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2021-12-16 06:00:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:49,071 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-16 06:00:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,072 INFO L225 Difference]: With dead ends: 195 [2021-12-16 06:00:49,072 INFO L226 Difference]: Without dead ends: 195 [2021-12-16 06:00:49,073 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-16 06:00:49,074 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 536 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-16 06:00:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-16 06:00:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2021-12-16 06:00:49,089 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 11 [2021-12-16 06:00:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,089 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2021-12-16 06:00:49,090 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-16 06:00:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2021-12-16 06:00:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 06:00:49,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 06:00:49,091 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -618617196, now seen corresponding path program 1 times [2021-12-16 06:00:49,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071293974] [2021-12-16 06:00:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,166 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-16 06:00:49,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071293974] [2021-12-16 06:00:49,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071293974] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:49,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372555481] [2021-12-16 06:00:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:49,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:49,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:49,170 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,320 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2021-12-16 06:00:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:49,323 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-16 06:00:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,324 INFO L225 Difference]: With dead ends: 194 [2021-12-16 06:00:49,324 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 06:00:49,324 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-16 06:00:49,324 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 2 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 547 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 06:00:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-12-16 06:00:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.643939393939394) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-12-16 06:00:49,328 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 11 [2021-12-16 06:00:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,328 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-12-16 06:00:49,328 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-16 06:00:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-12-16 06:00:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 06:00:49,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 06:00:49,329 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2054096635, now seen corresponding path program 1 times [2021-12-16 06:00:49,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662332424] [2021-12-16 06:00:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,372 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-16 06:00:49,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662332424] [2021-12-16 06:00:49,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662332424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:49,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463438654] [2021-12-16 06:00:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:49,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:49,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:49,375 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,381 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2021-12-16 06:00:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:49,381 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-16 06:00:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,382 INFO L225 Difference]: With dead ends: 195 [2021-12-16 06:00:49,382 INFO L226 Difference]: Without dead ends: 195 [2021-12-16 06:00:49,382 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-16 06:00:49,383 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-16 06:00:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-16 06:00:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2021-12-16 06:00:49,387 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 13 [2021-12-16 06:00:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,387 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2021-12-16 06:00:49,387 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-16 06:00:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2021-12-16 06:00:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 06:00:49,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 06:00:49,388 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 479764253, now seen corresponding path program 1 times [2021-12-16 06:00:49,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232214368] [2021-12-16 06:00:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,502 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-16 06:00:49,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232214368] [2021-12-16 06:00:49,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232214368] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:49,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161381018] [2021-12-16 06:00:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:49,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:49,504 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:49,687 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2021-12-16 06:00:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:00:49,687 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-16 06:00:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:49,688 INFO L225 Difference]: With dead ends: 195 [2021-12-16 06:00:49,688 INFO L226 Difference]: Without dead ends: 195 [2021-12-16 06:00:49,688 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-16 06:00:49,688 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 174 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:49,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 457 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-16 06:00:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2021-12-16 06:00:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.631578947368421) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-12-16 06:00:49,693 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 14 [2021-12-16 06:00:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:49,693 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-12-16 06:00:49,693 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-16 06:00:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-12-16 06:00:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 06:00:49,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:49,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:49,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 06:00:49,694 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 479764254, now seen corresponding path program 1 times [2021-12-16 06:00:49,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223492539] [2021-12-16 06:00:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:49,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:49,814 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-16 06:00:49,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:49,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223492539] [2021-12-16 06:00:49,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223492539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:49,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:49,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:49,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145932140] [2021-12-16 06:00:49,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:49,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:00:49,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:49,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:00:49,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:00:49,817 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,072 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2021-12-16 06:00:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:00:50,072 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-16 06:00:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,073 INFO L225 Difference]: With dead ends: 194 [2021-12-16 06:00:50,073 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 06:00:50,073 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-16 06:00:50,074 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 170 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 495 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 06:00:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2021-12-16 06:00:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2021-12-16 06:00:50,077 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 14 [2021-12-16 06:00:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,077 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2021-12-16 06:00:50,077 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-16 06:00:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2021-12-16 06:00:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 06:00:50,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:50,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 06:00:50,077 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1699725866, now seen corresponding path program 1 times [2021-12-16 06:00:50,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477472931] [2021-12-16 06:00:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,135 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-16 06:00:50,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477472931] [2021-12-16 06:00:50,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477472931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:50,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754331752] [2021-12-16 06:00:50,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:00:50,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:00:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:00:50,137 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,296 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2021-12-16 06:00:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:50,296 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-16 06:00:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,297 INFO L225 Difference]: With dead ends: 285 [2021-12-16 06:00:50,297 INFO L226 Difference]: Without dead ends: 285 [2021-12-16 06:00:50,297 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-16 06:00:50,298 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 205 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 724 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-16 06:00:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 190. [2021-12-16 06:00:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.6259541984732824) internal successors, (213), 189 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 213 transitions. [2021-12-16 06:00:50,302 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 213 transitions. Word has length 15 [2021-12-16 06:00:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,302 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 213 transitions. [2021-12-16 06:00:50,302 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-16 06:00:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 213 transitions. [2021-12-16 06:00:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 06:00:50,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:00:50,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 06:00:50,302 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash -99613104, now seen corresponding path program 1 times [2021-12-16 06:00:50,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512353557] [2021-12-16 06:00:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,347 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-16 06:00:50,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512353557] [2021-12-16 06:00:50,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512353557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:50,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949999495] [2021-12-16 06:00:50,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:50,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:50,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:50,349 INFO L87 Difference]: Start difference. First operand 190 states and 213 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,449 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2021-12-16 06:00:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:00:50,450 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-16 06:00:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,451 INFO L225 Difference]: With dead ends: 286 [2021-12-16 06:00:50,451 INFO L226 Difference]: Without dead ends: 286 [2021-12-16 06:00:50,451 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-16 06:00:50,451 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 602 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-12-16 06:00:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 193. [2021-12-16 06:00:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 192 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2021-12-16 06:00:50,455 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 17 [2021-12-16 06:00:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,455 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2021-12-16 06:00:50,455 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-16 06:00:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2021-12-16 06:00:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 06:00:50,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,456 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-16 06:00:50,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 06:00:50,456 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -582241035, now seen corresponding path program 1 times [2021-12-16 06:00:50,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38160528] [2021-12-16 06:00:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,518 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-16 06:00:50,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38160528] [2021-12-16 06:00:50,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38160528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:50,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075804981] [2021-12-16 06:00:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:50,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:50,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:50,520 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,649 INFO L93 Difference]: Finished difference Result 262 states and 279 transitions. [2021-12-16 06:00:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-16 06:00:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,650 INFO L225 Difference]: With dead ends: 262 [2021-12-16 06:00:50,650 INFO L226 Difference]: Without dead ends: 262 [2021-12-16 06:00:50,650 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-16 06:00:50,651 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 264 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 215 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-16 06:00:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 219. [2021-12-16 06:00:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.64375) internal successors, (263), 218 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 263 transitions. [2021-12-16 06:00:50,654 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 263 transitions. Word has length 19 [2021-12-16 06:00:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,654 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 263 transitions. [2021-12-16 06:00:50,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 263 transitions. [2021-12-16 06:00:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 06:00:50,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,655 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-16 06:00:50,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 06:00:50,655 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash -582241036, now seen corresponding path program 1 times [2021-12-16 06:00:50,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493592322] [2021-12-16 06:00:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,697 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-16 06:00:50,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493592322] [2021-12-16 06:00:50,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493592322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:50,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808232325] [2021-12-16 06:00:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:50,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:50,698 INFO L87 Difference]: Start difference. First operand 219 states and 263 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,806 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2021-12-16 06:00:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-16 06:00:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,808 INFO L225 Difference]: With dead ends: 212 [2021-12-16 06:00:50,808 INFO L226 Difference]: Without dead ends: 212 [2021-12-16 06:00:50,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:50,809 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 255 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 118 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-16 06:00:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2021-12-16 06:00:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.5375) internal successors, (246), 207 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 246 transitions. [2021-12-16 06:00:50,814 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 246 transitions. Word has length 19 [2021-12-16 06:00:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,814 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 246 transitions. [2021-12-16 06:00:50,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 246 transitions. [2021-12-16 06:00:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-16 06:00:50,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,817 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-16 06:00:50,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 06:00:50,818 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1187837214, now seen corresponding path program 1 times [2021-12-16 06:00:50,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745697427] [2021-12-16 06:00:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,849 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-16 06:00:50,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745697427] [2021-12-16 06:00:50,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745697427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:50,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213179084] [2021-12-16 06:00:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:00:50,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:00:50,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:00:50,851 INFO L87 Difference]: Start difference. First operand 208 states and 246 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:50,918 INFO L93 Difference]: Finished difference Result 240 states and 256 transitions. [2021-12-16 06:00:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:00:50,918 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-16 06:00:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:50,919 INFO L225 Difference]: With dead ends: 240 [2021-12-16 06:00:50,919 INFO L226 Difference]: Without dead ends: 240 [2021-12-16 06:00:50,919 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-16 06:00:50,920 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 235 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:50,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 276 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-16 06:00:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2021-12-16 06:00:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 159 states have (on average 1.528301886792453) internal successors, (243), 205 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2021-12-16 06:00:50,923 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 21 [2021-12-16 06:00:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:50,923 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2021-12-16 06:00:50,923 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-16 06:00:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2021-12-16 06:00:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:00:50,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:50,924 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-16 06:00:50,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 06:00:50,924 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 903845878, now seen corresponding path program 1 times [2021-12-16 06:00:50,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741066373] [2021-12-16 06:00:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:50,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:50,956 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-16 06:00:50,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741066373] [2021-12-16 06:00:50,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741066373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:50,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:50,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:50,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376990361] [2021-12-16 06:00:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:50,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:50,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:50,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:50,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:50,958 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,104 INFO L93 Difference]: Finished difference Result 206 states and 243 transitions. [2021-12-16 06:00:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:00:51,105 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-16 06:00:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,105 INFO L225 Difference]: With dead ends: 206 [2021-12-16 06:00:51,105 INFO L226 Difference]: Without dead ends: 206 [2021-12-16 06:00:51,106 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-16 06:00:51,106 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 104 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 443 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-16 06:00:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2021-12-16 06:00:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.5220125786163523) internal successors, (242), 204 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2021-12-16 06:00:51,109 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 23 [2021-12-16 06:00:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,109 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2021-12-16 06:00:51,110 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-16 06:00:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2021-12-16 06:00:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 06:00:51,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,110 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-16 06:00:51,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 06:00:51,110 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:51,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,110 INFO L85 PathProgramCache]: Analyzing trace with hash 903845879, now seen corresponding path program 1 times [2021-12-16 06:00:51,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425419736] [2021-12-16 06:00:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,159 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-16 06:00:51,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425419736] [2021-12-16 06:00:51,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425419736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:00:51,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740362983] [2021-12-16 06:00:51,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:51,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:51,161 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,335 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-12-16 06:00:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:00:51,336 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-16 06:00:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,337 INFO L225 Difference]: With dead ends: 198 [2021-12-16 06:00:51,337 INFO L226 Difference]: Without dead ends: 198 [2021-12-16 06:00:51,337 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-16 06:00:51,337 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 41 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 510 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-16 06:00:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-12-16 06:00:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.474025974025974) internal successors, (227), 190 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-12-16 06:00:51,341 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 23 [2021-12-16 06:00:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,341 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-12-16 06:00:51,341 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-16 06:00:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-12-16 06:00:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 06:00:51,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,342 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-16 06:00:51,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 06:00:51,342 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1012497526, now seen corresponding path program 1 times [2021-12-16 06:00:51,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928910288] [2021-12-16 06:00:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,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-16 06:00:51,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928910288] [2021-12-16 06:00:51,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928910288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:00:51,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244574832] [2021-12-16 06:00:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:00:51,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:00:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:00:51,391 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,500 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2021-12-16 06:00:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:00:51,500 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-16 06:00:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,501 INFO L225 Difference]: With dead ends: 194 [2021-12-16 06:00:51,501 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 06:00:51,502 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-16 06:00:51,502 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 38 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 621 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 06:00:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2021-12-16 06:00:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 186 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 223 transitions. [2021-12-16 06:00:51,506 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 223 transitions. Word has length 25 [2021-12-16 06:00:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,507 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 223 transitions. [2021-12-16 06:00:51,507 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-16 06:00:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2021-12-16 06:00:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 06:00:51,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,508 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-16 06:00:51,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 06:00:51,508 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 476921774, now seen corresponding path program 1 times [2021-12-16 06:00:51,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640045262] [2021-12-16 06:00:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,530 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-16 06:00:51,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640045262] [2021-12-16 06:00:51,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640045262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:51,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531658225] [2021-12-16 06:00:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:51,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:51,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:51,532 INFO L87 Difference]: Start difference. First operand 187 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,541 INFO L93 Difference]: Finished difference Result 260 states and 311 transitions. [2021-12-16 06:00:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:51,541 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-16 06:00:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,542 INFO L225 Difference]: With dead ends: 260 [2021-12-16 06:00:51,543 INFO L226 Difference]: Without dead ends: 260 [2021-12-16 06:00:51,543 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-16 06:00:51,543 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 50 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-16 06:00:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2021-12-16 06:00:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 192 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2021-12-16 06:00:51,548 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 27 [2021-12-16 06:00:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,548 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2021-12-16 06:00:51,549 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-16 06:00:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2021-12-16 06:00:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 06:00:51,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,549 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-16 06:00:51,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 06:00:51,550 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1899651814, now seen corresponding path program 1 times [2021-12-16 06:00:51,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121019253] [2021-12-16 06:00:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,573 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-16 06:00:51,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121019253] [2021-12-16 06:00:51,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121019253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:51,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422161525] [2021-12-16 06:00:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:51,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:51,575 INFO L87 Difference]: Start difference. First operand 193 states and 231 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:51,591 INFO L93 Difference]: Finished difference Result 191 states and 228 transitions. [2021-12-16 06:00:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:51,592 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-16 06:00:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:51,593 INFO L225 Difference]: With dead ends: 191 [2021-12-16 06:00:51,593 INFO L226 Difference]: Without dead ends: 191 [2021-12-16 06:00:51,593 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-16 06:00:51,594 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:51,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-16 06:00:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-12-16 06:00:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 190 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2021-12-16 06:00:51,598 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 28 [2021-12-16 06:00:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:51,598 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2021-12-16 06:00:51,598 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-16 06:00:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2021-12-16 06:00:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 06:00:51,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:51,599 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-16 06:00:51,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 06:00:51,599 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1240331581, now seen corresponding path program 1 times [2021-12-16 06:00:51,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:51,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093047705] [2021-12-16 06:00:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:51,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:51,696 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-16 06:00:51,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:51,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093047705] [2021-12-16 06:00:51,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093047705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:51,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:51,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 06:00:51,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199140659] [2021-12-16 06:00:51,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:51,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:51,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:51,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:00:51,699 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:52,001 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2021-12-16 06:00:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 06:00:52,002 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-16 06:00:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:52,003 INFO L225 Difference]: With dead ends: 321 [2021-12-16 06:00:52,003 INFO L226 Difference]: Without dead ends: 321 [2021-12-16 06:00:52,003 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-16 06:00:52,003 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 508 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:52,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 736 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-12-16 06:00:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 224. [2021-12-16 06:00:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 190 states have (on average 1.4) internal successors, (266), 223 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2021-12-16 06:00:52,008 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 29 [2021-12-16 06:00:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:52,008 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2021-12-16 06:00:52,008 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-16 06:00:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2021-12-16 06:00:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-16 06:00:52,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:52,009 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-16 06:00:52,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 06:00:52,009 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1491142186, now seen corresponding path program 1 times [2021-12-16 06:00:52,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:52,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029767806] [2021-12-16 06:00:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,084 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-16 06:00:52,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029767806] [2021-12-16 06:00:52,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029767806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697931308] [2021-12-16 06:00:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:52,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:52,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:52,087 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-16 06:00:52,115 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-16 06:00:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:52,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 06:00:52,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:52,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:52,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:52,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:00:52,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:52,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:00:52,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:52,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:00:52,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:52,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:00:52,526 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:00:52,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-16 06:00:52,538 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-16 06:00:52,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:00:53,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-16 06:00:53,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-16 06:00:53,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-16 06:00:53,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-16 06:00:53,058 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-16 06:00:53,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697931308] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:00:53,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:00:53,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-16 06:00:53,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872259913] [2021-12-16 06:00:53,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 06:00:53,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 06:00:53,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:53,060 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,250 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2021-12-16 06:00:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:00:53,251 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-16 06:00:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,252 INFO L225 Difference]: With dead ends: 261 [2021-12-16 06:00:53,252 INFO L226 Difference]: Without dead ends: 261 [2021-12-16 06:00:53,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-16 06:00:53,252 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 257 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 755 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 200 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2021-12-16 06:00:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-12-16 06:00:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2021-12-16 06:00:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 209 states have (on average 1.368421052631579) internal successors, (286), 242 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 286 transitions. [2021-12-16 06:00:53,256 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 286 transitions. Word has length 31 [2021-12-16 06:00:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,256 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 286 transitions. [2021-12-16 06:00:53,256 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-16 06:00:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 286 transitions. [2021-12-16 06:00:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 06:00:53,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,257 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-16 06:00:53,278 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-16 06:00:53,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:53,463 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash 883081196, now seen corresponding path program 1 times [2021-12-16 06:00:53,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950653087] [2021-12-16 06:00:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,494 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-16 06:00:53,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950653087] [2021-12-16 06:00:53,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950653087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:53,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:53,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390584984] [2021-12-16 06:00:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:53,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:53,496 INFO L87 Difference]: Start difference. First operand 243 states and 286 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-16 06:00:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,590 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2021-12-16 06:00:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:53,592 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-16 06:00:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,593 INFO L225 Difference]: With dead ends: 242 [2021-12-16 06:00:53,593 INFO L226 Difference]: Without dead ends: 242 [2021-12-16 06:00:53,593 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-16 06:00:53,593 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 4 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 426 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-16 06:00:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-16 06:00:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 241 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 285 transitions. [2021-12-16 06:00:53,598 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 285 transitions. Word has length 33 [2021-12-16 06:00:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,598 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 285 transitions. [2021-12-16 06:00:53,598 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-16 06:00:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 285 transitions. [2021-12-16 06:00:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 06:00:53,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,599 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-16 06:00:53,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 06:00:53,599 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 883081197, now seen corresponding path program 1 times [2021-12-16 06:00:53,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318361804] [2021-12-16 06:00:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,643 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-16 06:00:53,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318361804] [2021-12-16 06:00:53,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318361804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:53,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:00:53,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428208034] [2021-12-16 06:00:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:00:53,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:00:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:00:53,645 INFO L87 Difference]: Start difference. First operand 242 states and 285 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-16 06:00:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:53,746 INFO L93 Difference]: Finished difference Result 241 states and 284 transitions. [2021-12-16 06:00:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:00:53,746 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-16 06:00:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:53,747 INFO L225 Difference]: With dead ends: 241 [2021-12-16 06:00:53,747 INFO L226 Difference]: Without dead ends: 241 [2021-12-16 06:00:53,748 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-16 06:00:53,748 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 2 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:53,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-16 06:00:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2021-12-16 06:00:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 240 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 284 transitions. [2021-12-16 06:00:53,752 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 284 transitions. Word has length 33 [2021-12-16 06:00:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:53,752 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 284 transitions. [2021-12-16 06:00:53,752 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-16 06:00:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 284 transitions. [2021-12-16 06:00:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 06:00:53,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:53,753 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-16 06:00:53,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 06:00:53,753 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374941, now seen corresponding path program 1 times [2021-12-16 06:00:53,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:53,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307437820] [2021-12-16 06:00:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:53,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:53,886 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-16 06:00:53,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:53,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307437820] [2021-12-16 06:00:53,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307437820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:53,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:53,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 06:00:53,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749774145] [2021-12-16 06:00:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:53,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:00:53,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:53,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:00:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:00:53,888 INFO L87 Difference]: Start difference. First operand 241 states and 284 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-16 06:00:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:54,320 INFO L93 Difference]: Finished difference Result 413 states and 466 transitions. [2021-12-16 06:00:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 06:00:54,320 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-16 06:00:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:54,321 INFO L225 Difference]: With dead ends: 413 [2021-12-16 06:00:54,321 INFO L226 Difference]: Without dead ends: 413 [2021-12-16 06:00:54,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-12-16 06:00:54,322 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 631 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:54,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 863 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-16 06:00:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 252. [2021-12-16 06:00:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 222 states have (on average 1.3333333333333333) internal successors, (296), 251 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 296 transitions. [2021-12-16 06:00:54,326 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 296 transitions. Word has length 34 [2021-12-16 06:00:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:54,326 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 296 transitions. [2021-12-16 06:00:54,326 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-16 06:00:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 296 transitions. [2021-12-16 06:00:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 06:00:54,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:54,326 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-16 06:00:54,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 06:00:54,326 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1776374942, now seen corresponding path program 1 times [2021-12-16 06:00:54,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:54,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413153629] [2021-12-16 06:00:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:54,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:54,484 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-16 06:00:54,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:54,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413153629] [2021-12-16 06:00:54,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413153629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:54,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:54,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 06:00:54,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162455668] [2021-12-16 06:00:54,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:54,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 06:00:54,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:54,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 06:00:54,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:00:54,486 INFO L87 Difference]: Start difference. First operand 252 states and 296 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-16 06:00:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:55,073 INFO L93 Difference]: Finished difference Result 482 states and 529 transitions. [2021-12-16 06:00:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 06:00:55,074 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-16 06:00:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:55,075 INFO L225 Difference]: With dead ends: 482 [2021-12-16 06:00:55,075 INFO L226 Difference]: Without dead ends: 482 [2021-12-16 06:00:55,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-12-16 06:00:55,076 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 630 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:55,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 970 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 06:00:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-12-16 06:00:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 258. [2021-12-16 06:00:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 228 states have (on average 1.3289473684210527) internal successors, (303), 257 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 303 transitions. [2021-12-16 06:00:55,081 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 303 transitions. Word has length 34 [2021-12-16 06:00:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:55,082 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 303 transitions. [2021-12-16 06:00:55,083 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-16 06:00:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 303 transitions. [2021-12-16 06:00:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 06:00:55,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:55,083 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-16 06:00:55,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 06:00:55,084 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2030948706, now seen corresponding path program 1 times [2021-12-16 06:00:55,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:55,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880247574] [2021-12-16 06:00:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:55,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:55,124 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-16 06:00:55,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:55,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880247574] [2021-12-16 06:00:55,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880247574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:55,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:55,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 06:00:55,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547656001] [2021-12-16 06:00:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:55,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:55,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:55,128 INFO L87 Difference]: Start difference. First operand 258 states and 303 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-16 06:00:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:55,141 INFO L93 Difference]: Finished difference Result 260 states and 305 transitions. [2021-12-16 06:00:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:55,142 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-16 06:00:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:55,142 INFO L225 Difference]: With dead ends: 260 [2021-12-16 06:00:55,143 INFO L226 Difference]: Without dead ends: 260 [2021-12-16 06:00:55,143 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-16 06:00:55,146 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:55,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-16 06:00:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2021-12-16 06:00:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 230 states have (on average 1.326086956521739) 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-16 06:00:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 305 transitions. [2021-12-16 06:00:55,149 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 305 transitions. Word has length 35 [2021-12-16 06:00:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:55,150 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 305 transitions. [2021-12-16 06:00:55,150 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-16 06:00:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 305 transitions. [2021-12-16 06:00:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 06:00:55,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:55,150 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-16 06:00:55,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 06:00:55,151 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:55,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1994309533, now seen corresponding path program 1 times [2021-12-16 06:00:55,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:55,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803332304] [2021-12-16 06:00:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:55,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:55,341 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-16 06:00:55,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:55,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803332304] [2021-12-16 06:00:55,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803332304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:55,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:55,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-16 06:00:55,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642315116] [2021-12-16 06:00:55,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:55,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 06:00:55,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 06:00:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:00:55,344 INFO L87 Difference]: Start difference. First operand 260 states and 305 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-16 06:00:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:56,025 INFO L93 Difference]: Finished difference Result 476 states and 523 transitions. [2021-12-16 06:00:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 06:00:56,026 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-16 06:00:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:56,027 INFO L225 Difference]: With dead ends: 476 [2021-12-16 06:00:56,027 INFO L226 Difference]: Without dead ends: 476 [2021-12-16 06:00:56,027 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-16 06:00:56,028 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 641 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:56,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 1398 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 06:00:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-12-16 06:00:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 260. [2021-12-16 06:00:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 230 states have (on average 1.3217391304347825) internal successors, (304), 259 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-16 06:00:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 304 transitions. [2021-12-16 06:00:56,032 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 304 transitions. Word has length 36 [2021-12-16 06:00:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:56,032 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 304 transitions. [2021-12-16 06:00:56,032 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-16 06:00:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 304 transitions. [2021-12-16 06:00:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 06:00:56,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:56,032 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] [2021-12-16 06:00:56,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 06:00:56,033 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1539099344, now seen corresponding path program 1 times [2021-12-16 06:00:56,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:56,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767504786] [2021-12-16 06:00:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:56,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:56,175 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-16 06:00:56,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767504786] [2021-12-16 06:00:56,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767504786] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614917250] [2021-12-16 06:00:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:56,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:56,176 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-16 06:00:56,178 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-16 06:00:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:56,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 06:00:56,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:56,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:00:56,305 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:00:56,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2021-12-16 06:00:56,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-16 06:00:56,413 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:56,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-16 06:00:56,462 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:00:56,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-16 06:00:56,579 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:00:56,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2021-12-16 06:00:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:00:56,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:00:56,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614917250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:56,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:00:56,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2021-12-16 06:00:56,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564478491] [2021-12-16 06:00:56,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:56,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:00:56,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:00:56,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-12-16 06:00:56,656 INFO L87 Difference]: Start difference. First operand 260 states and 304 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) 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-16 06:00:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:57,094 INFO L93 Difference]: Finished difference Result 404 states and 447 transitions. [2021-12-16 06:00:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 06:00:57,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) 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-16 06:00:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:57,096 INFO L225 Difference]: With dead ends: 404 [2021-12-16 06:00:57,096 INFO L226 Difference]: Without dead ends: 394 [2021-12-16 06:00:57,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2021-12-16 06:00:57,097 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 383 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:57,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 874 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-12-16 06:00:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 260. [2021-12-16 06:00:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 230 states have (on average 1.3130434782608695) internal successors, (302), 259 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-16 06:00:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 302 transitions. [2021-12-16 06:00:57,102 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 302 transitions. Word has length 36 [2021-12-16 06:00:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:57,102 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 302 transitions. [2021-12-16 06:00:57,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) 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-16 06:00:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 302 transitions. [2021-12-16 06:00:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 06:00:57,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:57,103 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-16 06:00:57,123 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-16 06:00:57,319 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,SelfDestructingSolverStorable26 [2021-12-16 06:00:57,320 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -339896365, now seen corresponding path program 1 times [2021-12-16 06:00:57,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:57,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064339906] [2021-12-16 06:00:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:57,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:57,367 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-16 06:00:57,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:57,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064339906] [2021-12-16 06:00:57,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064339906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:57,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:57,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:57,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305307281] [2021-12-16 06:00:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:57,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:00:57,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:00:57,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:00:57,369 INFO L87 Difference]: Start difference. First operand 260 states and 302 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-16 06:00:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:57,517 INFO L93 Difference]: Finished difference Result 270 states and 312 transitions. [2021-12-16 06:00:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:00:57,518 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-16 06:00:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:57,518 INFO L225 Difference]: With dead ends: 270 [2021-12-16 06:00:57,518 INFO L226 Difference]: Without dead ends: 270 [2021-12-16 06:00:57,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:00:57,519 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:57,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 545 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-16 06:00:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2021-12-16 06:00:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 263 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-16 06:00:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2021-12-16 06:00:57,522 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 36 [2021-12-16 06:00:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:57,523 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2021-12-16 06:00:57,523 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-16 06:00:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2021-12-16 06:00:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 06:00:57,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:57,524 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-16 06:00:57,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-16 06:00:57,524 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350168, now seen corresponding path program 1 times [2021-12-16 06:00:57,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:57,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415901679] [2021-12-16 06:00:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:57,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:57,638 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-16 06:00:57,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:57,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415901679] [2021-12-16 06:00:57,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415901679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:57,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:57,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 06:00:57,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348656274] [2021-12-16 06:00:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:57,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:00:57,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:57,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:00:57,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:00:57,640 INFO L87 Difference]: Start difference. First operand 264 states and 306 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-16 06:00:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:57,896 INFO L93 Difference]: Finished difference Result 264 states and 306 transitions. [2021-12-16 06:00:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 06:00:57,897 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-16 06:00:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:57,897 INFO L225 Difference]: With dead ends: 264 [2021-12-16 06:00:57,897 INFO L226 Difference]: Without dead ends: 264 [2021-12-16 06:00:57,898 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-16 06:00:57,898 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 84 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:57,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 675 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-16 06:00:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2021-12-16 06:00:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 262 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-16 06:00:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2021-12-16 06:00:57,904 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 36 [2021-12-16 06:00:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:57,904 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2021-12-16 06:00:57,904 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-16 06:00:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2021-12-16 06:00:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 06:00:57,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:57,905 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-16 06:00:57,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-16 06:00:57,905 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1197350169, now seen corresponding path program 1 times [2021-12-16 06:00:57,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:57,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571418685] [2021-12-16 06:00:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:57,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:58,000 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-16 06:00:58,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:58,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571418685] [2021-12-16 06:00:58,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571418685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:58,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:58,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 06:00:58,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214754739] [2021-12-16 06:00:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:58,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:00:58,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:00:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:00:58,002 INFO L87 Difference]: Start difference. First operand 263 states and 305 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-16 06:00:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:58,302 INFO L93 Difference]: Finished difference Result 263 states and 305 transitions. [2021-12-16 06:00:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 06:00:58,303 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-16 06:00:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:58,303 INFO L225 Difference]: With dead ends: 263 [2021-12-16 06:00:58,303 INFO L226 Difference]: Without dead ends: 263 [2021-12-16 06:00:58,304 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-16 06:00:58,304 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 80 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:58,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 667 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-16 06:00:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2021-12-16 06:00:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 261 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-16 06:00:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 304 transitions. [2021-12-16 06:00:58,308 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 304 transitions. Word has length 36 [2021-12-16 06:00:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:58,308 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 304 transitions. [2021-12-16 06:00:58,308 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-16 06:00:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 304 transitions. [2021-12-16 06:00:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 06:00:58,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:58,309 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-16 06:00:58,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-16 06:00:58,309 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914429, now seen corresponding path program 1 times [2021-12-16 06:00:58,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:58,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89987432] [2021-12-16 06:00:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:58,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:58,364 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-16 06:00:58,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:58,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89987432] [2021-12-16 06:00:58,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89987432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:58,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:58,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:00:58,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058988318] [2021-12-16 06:00:58,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:58,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:00:58,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:58,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:00:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:00:58,366 INFO L87 Difference]: Start difference. First operand 262 states and 304 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-16 06:00:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:58,497 INFO L93 Difference]: Finished difference Result 272 states and 315 transitions. [2021-12-16 06:00:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:00:58,497 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-16 06:00:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:58,498 INFO L225 Difference]: With dead ends: 272 [2021-12-16 06:00:58,498 INFO L226 Difference]: Without dead ends: 272 [2021-12-16 06:00:58,498 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-16 06:00:58,498 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:58,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 457 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:00:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-16 06:00:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 258. [2021-12-16 06:00:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 257 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 299 transitions. [2021-12-16 06:00:58,502 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 299 transitions. Word has length 37 [2021-12-16 06:00:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:58,502 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 299 transitions. [2021-12-16 06:00:58,502 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-16 06:00:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 299 transitions. [2021-12-16 06:00:58,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 06:00:58,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:58,502 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-16 06:00:58,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-16 06:00:58,502 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash -160017480, now seen corresponding path program 1 times [2021-12-16 06:00:58,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:58,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55558613] [2021-12-16 06:00:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:58,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:58,519 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-16 06:00:58,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55558613] [2021-12-16 06:00:58,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55558613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:58,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:58,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:00:58,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114653176] [2021-12-16 06:00:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:58,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:00:58,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:58,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:00:58,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:00:58,521 INFO L87 Difference]: Start difference. First operand 258 states and 299 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-16 06:00:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:58,545 INFO L93 Difference]: Finished difference Result 271 states and 303 transitions. [2021-12-16 06:00:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:00:58,546 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-16 06:00:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:58,547 INFO L225 Difference]: With dead ends: 271 [2021-12-16 06:00:58,547 INFO L226 Difference]: Without dead ends: 271 [2021-12-16 06:00:58,547 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-16 06:00:58,547 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 174 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-16 06:00:58,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 174 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:00:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-16 06:00:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 259. [2021-12-16 06:00:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 232 states have (on average 1.293103448275862) internal successors, (300), 258 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-16 06:00:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 300 transitions. [2021-12-16 06:00:58,551 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 300 transitions. Word has length 38 [2021-12-16 06:00:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:58,551 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 300 transitions. [2021-12-16 06:00:58,551 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-16 06:00:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions. [2021-12-16 06:00:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-16 06:00:58,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:58,552 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-16 06:00:58,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-16 06:00:58,552 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 196879808, now seen corresponding path program 1 times [2021-12-16 06:00:58,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022492024] [2021-12-16 06:00:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:58,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:58,698 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-16 06:00:58,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:58,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022492024] [2021-12-16 06:00:58,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022492024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:00:58,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:00:58,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-16 06:00:58,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984151087] [2021-12-16 06:00:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:00:58,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 06:00:58,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 06:00:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:00:58,700 INFO L87 Difference]: Start difference. First operand 259 states and 300 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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-16 06:00:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:59,208 INFO L93 Difference]: Finished difference Result 367 states and 415 transitions. [2021-12-16 06:00:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 06:00:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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-16 06:00:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:59,209 INFO L225 Difference]: With dead ends: 367 [2021-12-16 06:00:59,209 INFO L226 Difference]: Without dead ends: 367 [2021-12-16 06:00:59,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-12-16 06:00:59,210 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 356 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:59,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 1123 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 06:00:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-12-16 06:00:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 259. [2021-12-16 06:00:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 232 states have (on average 1.2887931034482758) internal successors, (299), 258 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2021-12-16 06:00:59,214 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 39 [2021-12-16 06:00:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:59,214 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2021-12-16 06:00:59,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 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-16 06:00:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2021-12-16 06:00:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 06:00:59,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:59,215 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-16 06:00:59,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-16 06:00:59,215 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:00:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:00:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash 333412926, now seen corresponding path program 1 times [2021-12-16 06:00:59,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:00:59,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992387535] [2021-12-16 06:00:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:59,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:00:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:59,297 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-16 06:00:59,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:00:59,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992387535] [2021-12-16 06:00:59,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992387535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:00:59,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518245002] [2021-12-16 06:00:59,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:00:59,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:00:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:00:59,299 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-16 06:00:59,305 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-16 06:00:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:00:59,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 06:00:59,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:00:59,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:59,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:00:59,426 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:00:59,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:59,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:00:59,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:00:59,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:59,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:00:59,538 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-16 06:00:59,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:00:59,683 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-16 06:00:59,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518245002] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:00:59,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:00:59,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-16 06:00:59,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461655478] [2021-12-16 06:00:59,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:00:59,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 06:00:59,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:00:59,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 06:00:59,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 06:00:59,685 INFO L87 Difference]: Start difference. First operand 259 states and 299 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-16 06:00:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:00:59,990 INFO L93 Difference]: Finished difference Result 382 states and 421 transitions. [2021-12-16 06:00:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 06:00:59,990 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-16 06:00:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:00:59,991 INFO L225 Difference]: With dead ends: 382 [2021-12-16 06:00:59,992 INFO L226 Difference]: Without dead ends: 382 [2021-12-16 06:00:59,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-16 06:00:59,992 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 205 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:00:59,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 884 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:00:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-16 06:00:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 303. [2021-12-16 06:00:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 276 states have (on average 1.326086956521739) internal successors, (366), 302 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:00:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2021-12-16 06:00:59,998 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 41 [2021-12-16 06:00:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:00:59,998 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2021-12-16 06:00:59,998 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-16 06:00:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2021-12-16 06:00:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 06:00:59,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:00:59,998 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-16 06:01:00,029 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-16 06:01:00,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:01:00,211 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:01:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1745867301, now seen corresponding path program 1 times [2021-12-16 06:01:00,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:01:00,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310412509] [2021-12-16 06:01:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:00,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:01:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:00,257 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-16 06:01:00,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:01:00,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310412509] [2021-12-16 06:01:00,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310412509] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:01:00,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482323158] [2021-12-16 06:01:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:00,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:01:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:01:00,267 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-16 06:01:00,268 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-16 06:01:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:01:00,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 06:01:00,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:01:00,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-16 06:01:00,544 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-16 06:01:00,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:01:00,713 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-16 06:01:00,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482323158] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:01:00,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:01:00,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-16 06:01:00,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821426664] [2021-12-16 06:01:00,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:01:00,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:01:00,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:01:00,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:01:00,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:01:00,716 INFO L87 Difference]: Start difference. First operand 303 states and 366 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-16 06:01:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:01:00,790 INFO L93 Difference]: Finished difference Result 311 states and 373 transitions. [2021-12-16 06:01:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:01:00,790 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-16 06:01:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:01:00,791 INFO L225 Difference]: With dead ends: 311 [2021-12-16 06:01:00,791 INFO L226 Difference]: Without dead ends: 287 [2021-12-16 06:01:00,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:01:00,792 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:01:00,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2021-12-16 06:01:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-16 06:01:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 280. [2021-12-16 06:01:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 253 states have (on average 1.3517786561264822) internal successors, (342), 279 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 06:01:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 342 transitions. [2021-12-16 06:01:00,795 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 342 transitions. Word has length 42 [2021-12-16 06:01:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:01:00,795 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 342 transitions. [2021-12-16 06:01:00,795 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-16 06:01:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 342 transitions. [2021-12-16 06:01:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 06:01:00,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:01:00,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:00,816 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-16 06:01:01,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:01:01,003 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 77 more)] === [2021-12-16 06:01:01,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:01:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -377971448, now seen corresponding path program 1 times [2021-12-16 06:01:01,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:01:01,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726812360] [2021-12-16 06:01:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:01:01,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:01:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 06:01:01,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 06:01:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 06:01:01,058 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 06:01:01,058 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 06:01:01,059 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr57REQUIRES_VIOLATION (79 of 80 remaining) [2021-12-16 06:01:01,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (78 of 80 remaining) [2021-12-16 06:01:01,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (77 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (76 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (75 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (74 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (73 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (72 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (71 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (70 of 80 remaining) [2021-12-16 06:01:01,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (69 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (68 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (67 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (66 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (65 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (64 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (63 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (62 of 80 remaining) [2021-12-16 06:01:01,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (61 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (60 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (59 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (58 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (57 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (56 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (55 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (54 of 80 remaining) [2021-12-16 06:01:01,063 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (53 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (52 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (51 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (50 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (49 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (48 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (47 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (46 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (45 of 80 remaining) [2021-12-16 06:01:01,064 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (44 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (43 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (42 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (41 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (40 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (39 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (38 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (37 of 80 remaining) [2021-12-16 06:01:01,065 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (36 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (35 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (34 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (33 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (32 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (31 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (30 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (29 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (28 of 80 remaining) [2021-12-16 06:01:01,066 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (27 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (26 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (25 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (24 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (23 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (22 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (21 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (20 of 80 remaining) [2021-12-16 06:01:01,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (19 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (18 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (17 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (16 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (15 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION (14 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (13 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK (12 of 80 remaining) [2021-12-16 06:01:01,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION (11 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (10 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_FREE (8 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE (7 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (6 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION (5 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION (4 of 80 remaining) [2021-12-16 06:01:01,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2021-12-16 06:01:01,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2021-12-16 06:01:01,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2021-12-16 06:01:01,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2021-12-16 06:01:01,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-16 06:01:01,072 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:01:01,075 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 06:01:01,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:01:01 BoogieIcfgContainer [2021-12-16 06:01:01,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 06:01:01,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 06:01:01,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 06:01:01,096 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 06:01:01,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:00:48" (3/4) ... [2021-12-16 06:01:01,098 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 06:01:01,121 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 06:01:01,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 06:01:01,121 INFO L158 Benchmark]: Toolchain (without parser) took 13832.82ms. Allocated memory was 98.6MB in the beginning and 169.9MB in the end (delta: 71.3MB). Free memory was 66.9MB in the beginning and 131.0MB in the end (delta: -64.1MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,121 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 98.6MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 06:01:01,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.58ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 64.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.68ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 62.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,122 INFO L158 Benchmark]: Boogie Preprocessor took 33.88ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,122 INFO L158 Benchmark]: RCFGBuilder took 462.93ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 60.2MB in the beginning and 88.4MB in the end (delta: -28.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,122 INFO L158 Benchmark]: TraceAbstraction took 12885.77ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 88.0MB in the beginning and 134.1MB in the end (delta: -46.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,123 INFO L158 Benchmark]: Witness Printer took 25.22ms. Allocated memory is still 169.9MB. Free memory was 134.1MB in the beginning and 131.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 06:01:01,123 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 98.6MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.58ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 64.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.68ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 62.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.88ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.93ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 60.2MB in the beginning and 88.4MB in the end (delta: -28.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12885.77ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 88.0MB in the beginning and 134.1MB in the end (delta: -46.2MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. * Witness Printer took 25.22ms. Allocated memory is still 169.9MB. Free memory was 134.1MB in the beginning and 131.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 195 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 36, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6178 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6178 mSDsluCounter, 18597 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 107 IncrementalHoareTripleChecker+Unchecked, 13727 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8990 IncrementalHoareTripleChecker+Invalid, 9467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 4870 mSDtfsCounter, 8990 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 294 SyntacticMatches, 8 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=34, InterpolantAutomatonStates: 296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 1473 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1119 ConstructedInterpolants, 19 QuantifiedInterpolants, 11226 SizeOfPredicates, 26 NumberOfNonLiveVariables, 716 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 42 InterpolantComputations, 32 PerfectInterpolantSequences, 16/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-16 06:01:01,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)