./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:07:34,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:07:34,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:07:34,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:07:34,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:07:34,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:07:34,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:07:34,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:07:34,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:07:34,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:07:34,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:07:34,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:07:34,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:07:34,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:07:34,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:07:34,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:07:34,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:07:34,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:07:34,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:07:34,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:07:34,597 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:07:34,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:07:34,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:07:34,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:07:34,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:07:34,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:07:34,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:07:34,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:07:34,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:07:34,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:07:34,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:07:34,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:07:34,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:07:34,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:07:34,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:07:34,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:07:34,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:07:34,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:07:34,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:07:34,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:07:34,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:07:34,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:07:34,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:07:34,651 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:07:34,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:07:34,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:07:34,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:07:34,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:07:34,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:07:34,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:07:34,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:07:34,653 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:07:34,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:07:34,654 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:07:34,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:07:34,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:07:34,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:07:34,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:07:34,655 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:07:34,655 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:07:34,655 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:07:34,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:07:34,656 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:07:34,656 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:07:34,656 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:07:34,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:07:34,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:07:34,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:07:34,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:34,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:07:34,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:07:34,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:07:34,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:07:34,658 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 -> a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 [2022-07-20 06:07:34,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:07:34,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:07:34,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:07:34,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:07:34,896 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:07:34,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-20 06:07:34,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280df24c9/4ce622d9234f400cb3c685e9edde500a/FLAGd56c051ba [2022-07-20 06:07:35,392 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:07:35,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-20 06:07:35,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280df24c9/4ce622d9234f400cb3c685e9edde500a/FLAGd56c051ba [2022-07-20 06:07:35,766 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280df24c9/4ce622d9234f400cb3c685e9edde500a [2022-07-20 06:07:35,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:07:35,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:07:35,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:35,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:07:35,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:07:35,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:35" (1/1) ... [2022-07-20 06:07:35,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7499eba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:35, skipping insertion in model container [2022-07-20 06:07:35,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:35" (1/1) ... [2022-07-20 06:07:35,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:07:35,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:07:36,136 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-queue-1.i[22387,22400] [2022-07-20 06:07:36,141 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-queue-1.i[22458,22471] [2022-07-20 06:07:36,143 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-queue-1.i[22532,22545] [2022-07-20 06:07:36,144 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-queue-1.i[22624,22637] [2022-07-20 06:07:36,145 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-queue-1.i[22701,22714] [2022-07-20 06:07:36,146 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-queue-1.i[22796,22809] [2022-07-20 06:07:36,148 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-queue-1.i[22873,22886] [2022-07-20 06:07:36,150 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-queue-1.i[22956,22969] [2022-07-20 06:07:36,151 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-queue-1.i[23051,23064] [2022-07-20 06:07:36,154 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-queue-1.i[23128,23141] [2022-07-20 06:07:36,155 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-queue-1.i[23211,23224] [2022-07-20 06:07:36,157 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-queue-1.i[23300,23313] [2022-07-20 06:07:36,158 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-queue-1.i[23386,23399] [2022-07-20 06:07:36,161 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-queue-1.i[23532,23545] [2022-07-20 06:07:36,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:36,180 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:07:36,217 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-queue-1.i[22387,22400] [2022-07-20 06:07:36,218 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-queue-1.i[22458,22471] [2022-07-20 06:07:36,223 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-queue-1.i[22532,22545] [2022-07-20 06:07:36,229 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-queue-1.i[22624,22637] [2022-07-20 06:07:36,230 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-queue-1.i[22701,22714] [2022-07-20 06:07:36,231 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-queue-1.i[22796,22809] [2022-07-20 06:07:36,231 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-queue-1.i[22873,22886] [2022-07-20 06:07:36,232 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-queue-1.i[22956,22969] [2022-07-20 06:07:36,233 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-queue-1.i[23051,23064] [2022-07-20 06:07:36,240 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-queue-1.i[23128,23141] [2022-07-20 06:07:36,241 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-queue-1.i[23211,23224] [2022-07-20 06:07:36,242 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-queue-1.i[23300,23313] [2022-07-20 06:07:36,244 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-queue-1.i[23386,23399] [2022-07-20 06:07:36,246 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-queue-1.i[23532,23545] [2022-07-20 06:07:36,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:36,282 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:07:36,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36 WrapperNode [2022-07-20 06:07:36,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:36,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:36,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:07:36,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:07:36,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,333 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2022-07-20 06:07:36,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:36,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:07:36,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:07:36,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:07:36,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:07:36,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:07:36,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:07:36,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:07:36,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (1/1) ... [2022-07-20 06:07:36,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:36,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:36,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:07:36,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:07:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:07:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:07:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:07:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:07:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:07:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:07:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:07:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:07:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:07:36,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:07:36,519 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:07:36,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:07:36,923 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:07:36,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:07:36,937 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-20 06:07:36,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:36 BoogieIcfgContainer [2022-07-20 06:07:36,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:07:36,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:07:36,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:07:36,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:07:36,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:07:35" (1/3) ... [2022-07-20 06:07:36,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a15f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:36, skipping insertion in model container [2022-07-20 06:07:36,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:36" (2/3) ... [2022-07-20 06:07:36,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a15f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:36, skipping insertion in model container [2022-07-20 06:07:36,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:36" (3/3) ... [2022-07-20 06:07:36,951 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2022-07-20 06:07:36,964 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:07:36,964 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-20 06:07:37,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:07:37,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@273cef69, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f193bc4 [2022-07-20 06:07:37,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-20 06:07:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:37,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:37,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:07:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499500702] [2022-07-20 06:07:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499500702] [2022-07-20 06:07:37,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499500702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052386503] [2022-07-20 06:07:37,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:37,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:37,236 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,417 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-20 06:07:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:37,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:07:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,430 INFO L225 Difference]: With dead ends: 169 [2022-07-20 06:07:37,431 INFO L226 Difference]: Without dead ends: 165 [2022-07-20 06:07:37,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:37,439 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:37,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-20 06:07:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-20 06:07:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-07-20 06:07:37,501 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2022-07-20 06:07:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,501 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-07-20 06:07:37,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-07-20 06:07:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:37,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:37,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:07:37,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:07:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977646932] [2022-07-20 06:07:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977646932] [2022-07-20 06:07:37,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977646932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615278284] [2022-07-20 06:07:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:37,573 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,672 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-20 06:07:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:07:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,682 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:07:37,683 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 06:07:37,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:37,685 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:37,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 06:07:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-20 06:07:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-20 06:07:37,696 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-20 06:07:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,696 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-20 06:07:37,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-20 06:07:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:07:37,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:37,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:07:37,698 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-20 06:07:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952999114] [2022-07-20 06:07:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952999114] [2022-07-20 06:07:37,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952999114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787419898] [2022-07-20 06:07:37,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:37,795 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,900 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-07-20 06:07:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:07:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,902 INFO L225 Difference]: With dead ends: 161 [2022-07-20 06:07:37,902 INFO L226 Difference]: Without dead ends: 161 [2022-07-20 06:07:37,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:37,903 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:37,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-20 06:07:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2022-07-20 06:07:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2022-07-20 06:07:37,920 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2022-07-20 06:07:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,920 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2022-07-20 06:07:37,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-07-20 06:07:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:07:37,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:37,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:07:37,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:37,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-20 06:07:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914586588] [2022-07-20 06:07:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914586588] [2022-07-20 06:07:37,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914586588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327176985] [2022-07-20 06:07:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:37,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:37,996 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,153 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2022-07-20 06:07:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:07:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,155 INFO L225 Difference]: With dead ends: 244 [2022-07-20 06:07:38,155 INFO L226 Difference]: Without dead ends: 244 [2022-07-20 06:07:38,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:38,159 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:38,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-20 06:07:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-07-20 06:07:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2022-07-20 06:07:38,169 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2022-07-20 06:07:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,170 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2022-07-20 06:07:38,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-07-20 06:07:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:07:38,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:38,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:07:38,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2022-07-20 06:07:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115371334] [2022-07-20 06:07:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:38,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:38,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115371334] [2022-07-20 06:07:38,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115371334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:38,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:38,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:38,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415298419] [2022-07-20 06:07:38,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:38,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:38,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:38,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:38,213 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,240 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-07-20 06:07:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:38,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 06:07:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,242 INFO L225 Difference]: With dead ends: 148 [2022-07-20 06:07:38,242 INFO L226 Difference]: Without dead ends: 148 [2022-07-20 06:07:38,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:38,243 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:38,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-20 06:07:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-20 06:07:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-07-20 06:07:38,262 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2022-07-20 06:07:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-07-20 06:07:38,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-07-20 06:07:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:07:38,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:38,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:07:38,263 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-20 06:07:38,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414070813] [2022-07-20 06:07:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:38,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414070813] [2022-07-20 06:07:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414070813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:38,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884946754] [2022-07-20 06:07:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:38,329 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,549 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2022-07-20 06:07:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:07:38,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 06:07:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,551 INFO L225 Difference]: With dead ends: 219 [2022-07-20 06:07:38,551 INFO L226 Difference]: Without dead ends: 219 [2022-07-20 06:07:38,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:07:38,553 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:38,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-20 06:07:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2022-07-20 06:07:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-20 06:07:38,560 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2022-07-20 06:07:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,560 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-20 06:07:38,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-20 06:07:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:07:38,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:38,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:07:38,562 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-20 06:07:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636170091] [2022-07-20 06:07:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636170091] [2022-07-20 06:07:38,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636170091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:38,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:38,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566934260] [2022-07-20 06:07:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:38,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:38,701 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,947 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-07-20 06:07:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:38,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 06:07:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,949 INFO L225 Difference]: With dead ends: 211 [2022-07-20 06:07:38,949 INFO L226 Difference]: Without dead ends: 211 [2022-07-20 06:07:38,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:07:38,950 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:38,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-20 06:07:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2022-07-20 06:07:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-20 06:07:38,953 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2022-07-20 06:07:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,953 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-20 06:07:38,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-20 06:07:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:07:38,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:38,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:07:38,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2022-07-20 06:07:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206544283] [2022-07-20 06:07:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206544283] [2022-07-20 06:07:39,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206544283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:39,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:39,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466261323] [2022-07-20 06:07:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:39,008 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,027 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-20 06:07:39,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:39,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 06:07:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,029 INFO L225 Difference]: With dead ends: 191 [2022-07-20 06:07:39,029 INFO L226 Difference]: Without dead ends: 191 [2022-07-20 06:07:39,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:39,030 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:39,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-20 06:07:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2022-07-20 06:07:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-07-20 06:07:39,034 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2022-07-20 06:07:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,035 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-07-20 06:07:39,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-07-20 06:07:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:07:39,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:39,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:07:39,036 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2022-07-20 06:07:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184444255] [2022-07-20 06:07:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:39,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184444255] [2022-07-20 06:07:39,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184444255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:39,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:39,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:07:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563632616] [2022-07-20 06:07:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:39,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:39,103 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,203 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-07-20 06:07:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 06:07:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,204 INFO L225 Difference]: With dead ends: 149 [2022-07-20 06:07:39,204 INFO L226 Difference]: Without dead ends: 149 [2022-07-20 06:07:39,205 INFO L412 NwaCegarLoop]: 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 [2022-07-20 06:07:39,205 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:39,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-20 06:07:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-07-20 06:07:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-20 06:07:39,209 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2022-07-20 06:07:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,210 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-20 06:07:39,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-20 06:07:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:07:39,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:39,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:07:39,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2022-07-20 06:07:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061960298] [2022-07-20 06:07:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061960298] [2022-07-20 06:07:39,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061960298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:39,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:39,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:07:39,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080427828] [2022-07-20 06:07:39,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:39,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:39,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:39,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:39,284 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,390 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-20 06:07:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:39,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 06:07:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,392 INFO L225 Difference]: With dead ends: 156 [2022-07-20 06:07:39,392 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 06:07:39,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:07:39,393 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:39,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 06:07:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-20 06:07:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-20 06:07:39,397 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2022-07-20 06:07:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,398 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-20 06:07:39,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-20 06:07:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:07:39,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:39,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:07:39,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2022-07-20 06:07:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330248678] [2022-07-20 06:07:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330248678] [2022-07-20 06:07:39,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330248678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:39,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:39,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128936997] [2022-07-20 06:07:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:39,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:39,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:39,444 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,528 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-20 06:07:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:39,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:07:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,530 INFO L225 Difference]: With dead ends: 152 [2022-07-20 06:07:39,530 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 06:07:39,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:39,531 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:39,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 06:07:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-20 06:07:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-07-20 06:07:39,535 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2022-07-20 06:07:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-07-20 06:07:39,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-07-20 06:07:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:07:39,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,537 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:39,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:07:39,537 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2022-07-20 06:07:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078806694] [2022-07-20 06:07:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078806694] [2022-07-20 06:07:39,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078806694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:39,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894400685] [2022-07-20 06:07:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:39,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:39,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:07:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:07:39,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:39,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:39,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:39,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:40,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894400685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:40,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:40,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-07-20 06:07:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750708787] [2022-07-20 06:07:40,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:40,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:40,122 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:40,389 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-07-20 06:07:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:07:40,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:07:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:40,391 INFO L225 Difference]: With dead ends: 181 [2022-07-20 06:07:40,392 INFO L226 Difference]: Without dead ends: 181 [2022-07-20 06:07:40,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:07:40,393 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 155 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:40,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-20 06:07:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2022-07-20 06:07:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-07-20 06:07:40,398 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2022-07-20 06:07:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:40,398 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-07-20 06:07:40,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-07-20 06:07:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:07:40,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:40,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:40,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 06:07:40,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 06:07:40,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:40,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2022-07-20 06:07:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085398580] [2022-07-20 06:07:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:40,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085398580] [2022-07-20 06:07:40,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085398580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:40,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312888639] [2022-07-20 06:07:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:40,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:40,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:40,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:40,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:07:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:40,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:07:40,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:40,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:07:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:40,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:40,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312888639] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:40,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:40,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 06:07:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239168583] [2022-07-20 06:07:40,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:40,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:40,943 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:41,065 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-07-20 06:07:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:07:41,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:07:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:41,067 INFO L225 Difference]: With dead ends: 172 [2022-07-20 06:07:41,067 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 06:07:41,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:41,068 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:41,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 06:07:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-20 06:07:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2022-07-20 06:07:41,073 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2022-07-20 06:07:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:41,073 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2022-07-20 06:07:41,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2022-07-20 06:07:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:07:41,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:41,076 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:41,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:41,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-20 06:07:41,301 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2022-07-20 06:07:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649543554] [2022-07-20 06:07:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649543554] [2022-07-20 06:07:41,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649543554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:41,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564989741] [2022-07-20 06:07:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:41,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:41,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:41,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:41,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:07:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:41,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:07:41,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:41,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:41,634 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:41,634 INFO L390 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 [2022-07-20 06:07:41,669 INFO L390 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 11 treesize of output 7 [2022-07-20 06:07:41,754 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:41,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 06:07:41,777 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:41,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:07:41,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 06:07:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:41,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:41,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-20 06:07:41,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-20 06:07:41,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:07:41,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:41,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-20 06:07:41,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:41,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-20 06:07:41,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:07:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:42,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564989741] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:42,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:42,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-20 06:07:42,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034643700] [2022-07-20 06:07:42,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:42,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:07:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:07:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2022-07-20 06:07:42,059 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:42,773 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-07-20 06:07:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:07:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:42,775 INFO L225 Difference]: With dead ends: 281 [2022-07-20 06:07:42,775 INFO L226 Difference]: Without dead ends: 281 [2022-07-20 06:07:42,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2022-07-20 06:07:42,776 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 527 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:42,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1402 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 901 Invalid, 0 Unknown, 531 Unchecked, 0.4s Time] [2022-07-20 06:07:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-20 06:07:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2022-07-20 06:07:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-07-20 06:07:42,779 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2022-07-20 06:07:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:42,780 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-07-20 06:07:42,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-07-20 06:07:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:07:42,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:42,780 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:42,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:42,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:42,992 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2022-07-20 06:07:42,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:42,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103863021] [2022-07-20 06:07:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:43,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103863021] [2022-07-20 06:07:43,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103863021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:43,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:43,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582391941] [2022-07-20 06:07:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:43,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:43,026 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:43,047 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-07-20 06:07:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 06:07:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:43,049 INFO L225 Difference]: With dead ends: 239 [2022-07-20 06:07:43,049 INFO L226 Difference]: Without dead ends: 239 [2022-07-20 06:07:43,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:43,050 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:43,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-20 06:07:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2022-07-20 06:07:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 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) [2022-07-20 06:07:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2022-07-20 06:07:43,068 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2022-07-20 06:07:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:43,068 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2022-07-20 06:07:43,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2022-07-20 06:07:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:07:43,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:43,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:43,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:07:43,070 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2022-07-20 06:07:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:43,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747979944] [2022-07-20 06:07:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:43,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747979944] [2022-07-20 06:07:43,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747979944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:43,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68349523] [2022-07-20 06:07:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:43,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:43,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:43,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:43,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:07:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:43,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:07:43,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:43,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:43,425 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:43,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:07:43,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:43,578 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:43,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:07:43,612 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:43,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:07:43,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:07:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:43,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:43,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-20 06:07:43,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-20 06:07:43,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:43,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-20 06:07:43,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:43,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-20 06:07:43,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-20 06:07:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:48,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68349523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:48,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:48,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-07-20 06:07:48,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281325905] [2022-07-20 06:07:48,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:48,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:07:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:48,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:07:48,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=611, Unknown=11, NotChecked=106, Total=870 [2022-07-20 06:07:48,206 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:48,945 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2022-07-20 06:07:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:07:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:07:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:48,947 INFO L225 Difference]: With dead ends: 247 [2022-07-20 06:07:48,947 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 06:07:48,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=344, Invalid=1293, Unknown=11, NotChecked=158, Total=1806 [2022-07-20 06:07:48,948 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 270 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:48,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1287 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 662 Invalid, 0 Unknown, 689 Unchecked, 0.4s Time] [2022-07-20 06:07:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 06:07:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 197. [2022-07-20 06:07:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2022-07-20 06:07:48,952 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2022-07-20 06:07:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:48,953 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2022-07-20 06:07:48,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2022-07-20 06:07:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:07:48,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:48,954 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:48,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:49,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-20 06:07:49,174 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2022-07-20 06:07:49,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:49,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256011757] [2022-07-20 06:07:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256011757] [2022-07-20 06:07:49,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256011757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178980577] [2022-07-20 06:07:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:49,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:49,434 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:49,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:07:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:49,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 06:07:49,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:49,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:49,599 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:49,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:07:49,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:49,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:49,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:49,792 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:49,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:07:49,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:07:49,809 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:49,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:07:49,856 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:49,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:07:49,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:07:50,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:07:50,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:50,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:50,261 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:07:50,282 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2022-07-20 06:07:50,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-20 06:07:50,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:50,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-20 06:07:50,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:50,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-20 06:07:50,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-20 06:07:50,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:50,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 06:07:50,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:50,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:07:50,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:50,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-20 06:07:50,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:50,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-20 06:07:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178980577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:50,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:50,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-07-20 06:07:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514449494] [2022-07-20 06:07:50,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:50,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:07:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:07:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-20 06:07:50,476 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:52,251 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2022-07-20 06:07:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 06:07:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 06:07:52,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:52,253 INFO L225 Difference]: With dead ends: 325 [2022-07-20 06:07:52,253 INFO L226 Difference]: Without dead ends: 325 [2022-07-20 06:07:52,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=471, Invalid=2294, Unknown=3, NotChecked=312, Total=3080 [2022-07-20 06:07:52,255 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1069 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:52,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1111 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1151 Invalid, 0 Unknown, 879 Unchecked, 0.7s Time] [2022-07-20 06:07:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-20 06:07:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 201. [2022-07-20 06:07:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.301775147928994) internal successors, (220), 200 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2022-07-20 06:07:52,262 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2022-07-20 06:07:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:52,263 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2022-07-20 06:07:52,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-07-20 06:07:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:07:52,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:52,264 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:52,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:52,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 06:07:52,465 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:52,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2022-07-20 06:07:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:52,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298341375] [2022-07-20 06:07:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:07:52,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:52,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298341375] [2022-07-20 06:07:52,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298341375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:52,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:52,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570817649] [2022-07-20 06:07:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:52,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:52,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:52,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:52,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:52,503 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:52,509 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2022-07-20 06:07:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:07:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:52,511 INFO L225 Difference]: With dead ends: 202 [2022-07-20 06:07:52,511 INFO L226 Difference]: Without dead ends: 202 [2022-07-20 06:07:52,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:52,512 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:52,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-20 06:07:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-20 06:07:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2022-07-20 06:07:52,516 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2022-07-20 06:07:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:52,517 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2022-07-20 06:07:52,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2022-07-20 06:07:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:07:52,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:52,518 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:52,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:07:52,518 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2022-07-20 06:07:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:52,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191338444] [2022-07-20 06:07:52,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:52,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191338444] [2022-07-20 06:07:52,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191338444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:52,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52938136] [2022-07-20 06:07:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:52,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:52,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:52,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:52,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:07:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:52,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 06:07:52,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:52,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:53,004 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:53,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:07:53,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:53,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:53,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:53,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:53,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:07:53,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:53,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:07:53,221 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:53,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2022-07-20 06:07:53,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-20 06:07:53,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:07:53,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-20 06:07:53,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-20 06:07:53,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:53,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:53,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:53,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-20 06:07:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:53,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:53,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2022-07-20 06:07:54,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 06:07:54,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2022-07-20 06:07:54,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-20 06:07:54,036 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:07:54,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-07-20 06:07:54,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:54,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:07:54,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:54,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:54,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:54,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:07:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:54,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52938136] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:54,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:54,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2022-07-20 06:07:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873128722] [2022-07-20 06:07:54,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:54,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 06:07:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:54,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 06:07:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 06:07:54,161 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:55,676 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2022-07-20 06:07:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:07:55,681 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:07:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:55,682 INFO L225 Difference]: With dead ends: 315 [2022-07-20 06:07:55,682 INFO L226 Difference]: Without dead ends: 315 [2022-07-20 06:07:55,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2022-07-20 06:07:55,684 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 457 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:55,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2102 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1241 Invalid, 0 Unknown, 605 Unchecked, 0.6s Time] [2022-07-20 06:07:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-20 06:07:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2022-07-20 06:07:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 200 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2022-07-20 06:07:55,688 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2022-07-20 06:07:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:55,689 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2022-07-20 06:07:55,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2022-07-20 06:07:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:07:55,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:55,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:55,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 06:07:55,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:55,908 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2022-07-20 06:07:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:55,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808895423] [2022-07-20 06:07:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808895423] [2022-07-20 06:07:56,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808895423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732518381] [2022-07-20 06:07:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:56,073 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:56,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:07:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:56,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 06:07:56,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:56,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:56,230 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:56,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:07:56,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:56,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:56,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:07:56,371 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:56,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:07:56,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:07:56,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-20 06:07:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:56,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:56,684 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:07:56,711 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2022-07-20 06:07:56,721 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-07-20 06:07:56,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:56,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-20 06:07:56,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:56,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-20 06:07:56,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:07:56,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:56,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-20 06:07:56,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:56,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:56,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 06:07:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:56,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732518381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:56,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:56,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-07-20 06:07:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170129834] [2022-07-20 06:07:56,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:07:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:56,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:07:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2022-07-20 06:07:56,864 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:57,377 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-07-20 06:07:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:57,377 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:07:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:57,378 INFO L225 Difference]: With dead ends: 248 [2022-07-20 06:07:57,378 INFO L226 Difference]: Without dead ends: 248 [2022-07-20 06:07:57,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2022-07-20 06:07:57,393 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 376 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:57,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1160 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 849 Invalid, 0 Unknown, 591 Unchecked, 0.4s Time] [2022-07-20 06:07:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-20 06:07:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2022-07-20 06:07:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-07-20 06:07:57,397 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2022-07-20 06:07:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:57,398 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-07-20 06:07:57,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-07-20 06:07:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:07:57,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:57,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:57,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 06:07:57,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:57,617 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2022-07-20 06:07:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697385437] [2022-07-20 06:07:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:57,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697385437] [2022-07-20 06:07:57,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697385437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:57,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082035184] [2022-07-20 06:07:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:57,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:57,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:57,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:57,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:07:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:57,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 06:07:57,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:57,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:57,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:57,922 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:57,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:07:57,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:57,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:07:58,052 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:58,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:07:58,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 06:07:58,067 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:58,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:07:58,102 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:07:58,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:07:58,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:07:58,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:58,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:58,551 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:07:58,571 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:07:58,579 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:07:58,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:58,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 06:07:58,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:58,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:07:58,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:58,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2022-07-20 06:07:58,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:58,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2022-07-20 06:07:58,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-20 06:07:58,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-07-20 06:07:58,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:58,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:07:58,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:58,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:07:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:07:58,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082035184] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:58,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:58,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-07-20 06:07:58,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428910938] [2022-07-20 06:07:58,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:58,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:07:58,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:58,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:07:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2022-07-20 06:07:58,778 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:59,552 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2022-07-20 06:07:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:07:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:07:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:59,553 INFO L225 Difference]: With dead ends: 247 [2022-07-20 06:07:59,553 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 06:07:59,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2022-07-20 06:07:59,555 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 434 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:59,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1063 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 906 Invalid, 0 Unknown, 486 Unchecked, 0.4s Time] [2022-07-20 06:07:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 06:07:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2022-07-20 06:07:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 223 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-07-20 06:07:59,559 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2022-07-20 06:07:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:59,560 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-07-20 06:07:59,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-07-20 06:07:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:07:59,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:59,561 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:59,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 06:07:59,784 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2022-07-20 06:07:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894471130] [2022-07-20 06:07:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 06:07:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:59,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894471130] [2022-07-20 06:07:59,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894471130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:59,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:59,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116965304] [2022-07-20 06:07:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:59,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:59,817 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:59,837 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-07-20 06:07:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:59,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 44 [2022-07-20 06:07:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:59,839 INFO L225 Difference]: With dead ends: 298 [2022-07-20 06:07:59,839 INFO L226 Difference]: Without dead ends: 298 [2022-07-20 06:07:59,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:59,840 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:59,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-20 06:07:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2022-07-20 06:07:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-07-20 06:07:59,845 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2022-07-20 06:07:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:59,845 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-07-20 06:07:59,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-07-20 06:07:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:07:59,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:59,846 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:59,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:07:59,847 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:07:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2022-07-20 06:07:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831446612] [2022-07-20 06:07:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:07:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:59,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831446612] [2022-07-20 06:07:59,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831446612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:59,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181279428] [2022-07-20 06:07:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:59,904 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:07:59,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:08:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:08:00,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:00,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-20 06:08:00,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-20 06:08:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:00,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:00,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181279428] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:00,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:00,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-20 06:08:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23671275] [2022-07-20 06:08:00,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:00,120 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:00,215 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2022-07-20 06:08:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:00,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 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 45 [2022-07-20 06:08:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:00,220 INFO L225 Difference]: With dead ends: 283 [2022-07-20 06:08:00,220 INFO L226 Difference]: Without dead ends: 275 [2022-07-20 06:08:00,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:00,221 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:00,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 349 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-20 06:08:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2022-07-20 06:08:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 268 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-07-20 06:08:00,226 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2022-07-20 06:08:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:00,226 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-07-20 06:08:00,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-07-20 06:08:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:08:00,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:00,226 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:00,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:00,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:00,427 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2022-07-20 06:08:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656766224] [2022-07-20 06:08:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:00,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656766224] [2022-07-20 06:08:00,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656766224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:00,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752583515] [2022-07-20 06:08:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:00,727 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:08:00,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:08:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 06:08:00,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:00,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:00,896 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:00,896 INFO L390 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 [2022-07-20 06:08:00,929 INFO L390 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 11 treesize of output 7 [2022-07-20 06:08:01,022 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:01,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 06:08:01,040 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:01,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 06:08:01,118 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:01,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:01,152 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:08:01,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-20 06:08:01,295 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:08:01,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-20 06:08:01,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 06:08:01,390 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:08:01,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-20 06:08:01,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 06:08:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:01,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:01,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-20 06:08:01,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-20 06:08:01,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-20 06:08:01,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-20 06:08:01,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:01,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:08:01,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-20 06:08:01,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-20 06:08:01,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_68| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_68|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-20 06:08:01,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:01,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 06:08:01,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:01,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 76 [2022-07-20 06:08:01,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:01,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2022-07-20 06:08:01,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-20 06:08:01,662 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:01,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:08:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 06:08:01,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752583515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:01,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:01,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-07-20 06:08:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301394306] [2022-07-20 06:08:01,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:01,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:08:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:01,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:08:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=925, Unknown=7, NotChecked=476, Total=1560 [2022-07-20 06:08:01,804 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:02,950 INFO L93 Difference]: Finished difference Result 336 states and 377 transitions. [2022-07-20 06:08:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:08:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-20 06:08:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:02,952 INFO L225 Difference]: With dead ends: 336 [2022-07-20 06:08:02,952 INFO L226 Difference]: Without dead ends: 336 [2022-07-20 06:08:02,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=396, Invalid=1881, Unknown=7, NotChecked=686, Total=2970 [2022-07-20 06:08:02,954 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 385 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:02,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1431 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 967 Invalid, 0 Unknown, 1233 Unchecked, 0.5s Time] [2022-07-20 06:08:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-20 06:08:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 292. [2022-07-20 06:08:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 291 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2022-07-20 06:08:02,958 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 45 [2022-07-20 06:08:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:02,959 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2022-07-20 06:08:02,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2022-07-20 06:08:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 06:08:02,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:02,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:02,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:03,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:08:03,171 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2022-07-20 06:08:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:03,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862315242] [2022-07-20 06:08:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:03,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862315242] [2022-07-20 06:08:03,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862315242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:03,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683154881] [2022-07-20 06:08:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:03,299 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:08:03,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:08:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:03,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 06:08:03,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:03,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:03,458 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:03,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:03,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:03,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:03,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:08:03,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:08:03,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:08:03,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:03,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:03,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-20 06:08:03,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-20 06:08:03,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-20 06:08:03,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:03,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:08:03,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:03,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-20 06:08:03,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 06:08:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:03,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683154881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:03,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:03,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2022-07-20 06:08:03,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323311438] [2022-07-20 06:08:03,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:03,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 06:08:03,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:03,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 06:08:03,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2022-07-20 06:08:03,776 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:04,252 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2022-07-20 06:08:04,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:08:04,253 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-20 06:08:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:04,254 INFO L225 Difference]: With dead ends: 301 [2022-07-20 06:08:04,254 INFO L226 Difference]: Without dead ends: 301 [2022-07-20 06:08:04,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=828, Unknown=3, NotChecked=192, Total=1260 [2022-07-20 06:08:04,255 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 409 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:04,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1193 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 753 Invalid, 0 Unknown, 512 Unchecked, 0.3s Time] [2022-07-20 06:08:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-20 06:08:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2022-07-20 06:08:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.2595419847328244) internal successors, (330), 293 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2022-07-20 06:08:04,267 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 46 [2022-07-20 06:08:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:04,267 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2022-07-20 06:08:04,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2022-07-20 06:08:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 06:08:04,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:04,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:04,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:04,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 06:08:04,497 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2022-07-20 06:08:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:04,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350458014] [2022-07-20 06:08:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:04,525 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-20 06:08:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 06:08:04,536 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 06:08:04,545 INFO L158 Benchmark]: Toolchain (without parser) took 28775.14ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 77.8MB in the beginning and 54.4MB in the end (delta: 23.3MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-07-20 06:08:04,546 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 52.2MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:08:04,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.42ms. Allocated memory is still 111.1MB. Free memory was 77.8MB in the beginning and 77.1MB in the end (delta: 643.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 06:08:04,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.22ms. Allocated memory is still 111.1MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:04,547 INFO L158 Benchmark]: Boogie Preprocessor took 29.57ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 73.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:04,547 INFO L158 Benchmark]: RCFGBuilder took 574.39ms. Allocated memory is still 111.1MB. Free memory was 72.4MB in the beginning and 50.5MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:04,551 INFO L158 Benchmark]: TraceAbstraction took 27599.56ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 49.9MB in the beginning and 54.4MB in the end (delta: -4.6MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2022-07-20 06:08:04,553 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.22ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 52.2MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.42ms. Allocated memory is still 111.1MB. Free memory was 77.8MB in the beginning and 77.1MB in the end (delta: 643.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.22ms. Allocated memory is still 111.1MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.57ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 73.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.39ms. Allocated memory is still 111.1MB. Free memory was 72.4MB in the beginning and 50.5MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 27599.56ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 49.9MB in the beginning and 54.4MB in the end (delta: -4.6MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 06:08:04,593 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:08:06,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:08:06,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:08:06,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:08:06,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:08:06,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:08:06,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:08:06,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:08:06,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:08:06,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:08:06,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:08:06,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:08:06,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:08:06,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:08:06,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:08:06,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:08:06,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:08:06,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:08:06,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:08:06,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:08:06,642 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:08:06,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:08:06,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:08:06,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:08:06,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:08:06,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:08:06,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:08:06,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:08:06,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:08:06,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:08:06,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:08:06,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:08:06,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:08:06,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:08:06,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:08:06,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:08:06,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:08:06,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:08:06,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:08:06,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:08:06,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:08:06,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:08:06,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:08:06,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:08:06,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:08:06,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:08:06,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:08:06,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:08:06,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:08:06,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:08:06,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:08:06,698 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:08:06,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:08:06,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:08:06,699 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:08:06,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:08:06,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:08:06,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:08:06,700 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:08:06,700 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:08:06,700 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:08:06,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:08:06,700 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:08:06,701 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:08:06,701 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:08:06,701 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:08:06,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:08:06,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:08:06,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:08:06,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:08:06,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:08:06,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:08:06,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:08:06,703 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:08:06,703 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:08:06,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:08:06,703 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 [2022-07-20 06:08:07,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:08:07,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:08:07,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:08:07,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:08:07,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:08:07,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-20 06:08:07,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f4cb8fd/47304b409eec494bb0c25b9890772b0f/FLAGe17eccb5b [2022-07-20 06:08:07,559 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:08:07,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2022-07-20 06:08:07,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f4cb8fd/47304b409eec494bb0c25b9890772b0f/FLAGe17eccb5b [2022-07-20 06:08:07,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f4cb8fd/47304b409eec494bb0c25b9890772b0f [2022-07-20 06:08:07,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:08:07,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:08:07,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:08:07,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:08:07,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:08:07,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:08:07" (1/1) ... [2022-07-20 06:08:07,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eb8ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:07, skipping insertion in model container [2022-07-20 06:08:07,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:08:07" (1/1) ... [2022-07-20 06:08:07,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:08:07,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:08:08,304 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-queue-1.i[22387,22400] [2022-07-20 06:08:08,308 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-queue-1.i[22458,22471] [2022-07-20 06:08:08,309 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-queue-1.i[22532,22545] [2022-07-20 06:08:08,311 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-queue-1.i[22624,22637] [2022-07-20 06:08:08,313 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-queue-1.i[22701,22714] [2022-07-20 06:08:08,314 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-queue-1.i[22796,22809] [2022-07-20 06:08:08,315 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-queue-1.i[22873,22886] [2022-07-20 06:08:08,316 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-queue-1.i[22956,22969] [2022-07-20 06:08:08,318 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-queue-1.i[23051,23064] [2022-07-20 06:08:08,319 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-queue-1.i[23128,23141] [2022-07-20 06:08:08,322 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-queue-1.i[23211,23224] [2022-07-20 06:08:08,323 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-queue-1.i[23300,23313] [2022-07-20 06:08:08,325 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-queue-1.i[23386,23399] [2022-07-20 06:08:08,327 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-queue-1.i[23532,23545] [2022-07-20 06:08:08,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:08:08,355 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:08:08,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i[22387,22400] [2022-07-20 06:08:08,394 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-queue-1.i[22458,22471] [2022-07-20 06:08:08,396 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-queue-1.i[22532,22545] [2022-07-20 06:08:08,397 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-queue-1.i[22624,22637] [2022-07-20 06:08:08,401 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-queue-1.i[22701,22714] [2022-07-20 06:08:08,402 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-queue-1.i[22796,22809] [2022-07-20 06:08:08,404 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-queue-1.i[22873,22886] [2022-07-20 06:08:08,404 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-queue-1.i[22956,22969] [2022-07-20 06:08:08,405 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-queue-1.i[23051,23064] [2022-07-20 06:08:08,407 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-queue-1.i[23128,23141] [2022-07-20 06:08:08,408 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-queue-1.i[23211,23224] [2022-07-20 06:08:08,410 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-queue-1.i[23300,23313] [2022-07-20 06:08:08,411 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-queue-1.i[23386,23399] [2022-07-20 06:08:08,414 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-queue-1.i[23532,23545] [2022-07-20 06:08:08,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:08:08,448 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:08:08,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08 WrapperNode [2022-07-20 06:08:08,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:08:08,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:08:08,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:08:08,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:08:08,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,513 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-07-20 06:08:08,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:08:08,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:08:08,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:08:08,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:08:08,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:08:08,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:08:08,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:08:08,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:08:08,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (1/1) ... [2022-07-20 06:08:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:08:08,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:08,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 06:08:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:08:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:08:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:08:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:08:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:08:08,738 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:08:08,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:08:09,192 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:08:09,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:08:09,198 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-20 06:08:09,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:08:09 BoogieIcfgContainer [2022-07-20 06:08:09,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:08:09,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:08:09,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:08:09,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:08:09,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:08:07" (1/3) ... [2022-07-20 06:08:09,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675f613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:08:09, skipping insertion in model container [2022-07-20 06:08:09,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:08" (2/3) ... [2022-07-20 06:08:09,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675f613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:08:09, skipping insertion in model container [2022-07-20 06:08:09,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:08:09" (3/3) ... [2022-07-20 06:08:09,206 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2022-07-20 06:08:09,217 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:08:09,217 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-20 06:08:09,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:08:09,268 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70e80067, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4682965d [2022-07-20 06:08:09,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-20 06:08:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 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) [2022-07-20 06:08:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:09,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:09,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:09,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:09,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:09,283 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:08:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:09,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991808202] [2022-07-20 06:08:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:09,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:09,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:09,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 06:08:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:09,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:09,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:09,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:09,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:09,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:09,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991808202] [2022-07-20 06:08:09,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991808202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:09,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:09,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751793134] [2022-07-20 06:08:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:09,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:09,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:09,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:09,478 INFO L87 Difference]: Start difference. First operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:09,696 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2022-07-20 06:08:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:08:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:09,706 INFO L225 Difference]: With dead ends: 166 [2022-07-20 06:08:09,706 INFO L226 Difference]: Without dead ends: 162 [2022-07-20 06:08:09,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:09,710 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 156 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:09,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-20 06:08:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-20 06:08:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 157 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-07-20 06:08:09,744 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2022-07-20 06:08:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:09,744 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-07-20 06:08:09,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-07-20 06:08:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:09,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:09,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:09,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:09,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:09,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:08:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:09,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487148350] [2022-07-20 06:08:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:09,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:09,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 06:08:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:10,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:08:10,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:10,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:10,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:10,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:10,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487148350] [2022-07-20 06:08:10,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487148350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:10,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:10,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717998398] [2022-07-20 06:08:10,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:10,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:10,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:10,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:10,032 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:10,212 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2022-07-20 06:08:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:10,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 06:08:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:10,214 INFO L225 Difference]: With dead ends: 152 [2022-07-20 06:08:10,214 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 06:08:10,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:10,216 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:10,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 06:08:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-07-20 06:08:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-20 06:08:10,228 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2022-07-20 06:08:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:10,229 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-20 06:08:10,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-20 06:08:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:08:10,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:10,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:10,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:10,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:10,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-07-20 06:08:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:10,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057746006] [2022-07-20 06:08:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:10,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:10,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:10,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 06:08:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:10,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:08:10,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:10,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:10,581 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:08:10,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 17 [2022-07-20 06:08:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:10,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:10,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:10,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057746006] [2022-07-20 06:08:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057746006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:10,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:10,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413119025] [2022-07-20 06:08:10,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:10,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:10,595 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:10,840 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-07-20 06:08:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-20 06:08:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:10,842 INFO L225 Difference]: With dead ends: 158 [2022-07-20 06:08:10,842 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 06:08:10,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:10,843 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:10,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 06:08:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-07-20 06:08:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 149 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2022-07-20 06:08:10,856 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2022-07-20 06:08:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:10,856 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2022-07-20 06:08:10,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2022-07-20 06:08:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:08:10,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:10,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:10,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:11,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:11,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-07-20 06:08:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:11,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130894593] [2022-07-20 06:08:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:11,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:11,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:11,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 06:08:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:11,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:11,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:11,224 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:08:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:11,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:11,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:11,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130894593] [2022-07-20 06:08:11,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130894593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:11,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:11,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329295667] [2022-07-20 06:08:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:11,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:11,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:11,246 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:11,580 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2022-07-20 06:08:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:11,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-20 06:08:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:11,582 INFO L225 Difference]: With dead ends: 240 [2022-07-20 06:08:11,582 INFO L226 Difference]: Without dead ends: 240 [2022-07-20 06:08:11,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:11,583 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:11,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:08:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-20 06:08:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2022-07-20 06:08:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 153 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2022-07-20 06:08:11,591 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2022-07-20 06:08:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:11,591 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2022-07-20 06:08:11,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-07-20 06:08:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:08:11,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:11,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:11,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:11,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:11,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2022-07-20 06:08:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:11,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416614696] [2022-07-20 06:08:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:11,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:11,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 06:08:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:11,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:11,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:11,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416614696] [2022-07-20 06:08:11,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416614696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:11,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:11,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521822665] [2022-07-20 06:08:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:11,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:11,888 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:11,940 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2022-07-20 06:08:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:11,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:08:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:11,942 INFO L225 Difference]: With dead ends: 144 [2022-07-20 06:08:11,942 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 06:08:11,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:11,943 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:11,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 06:08:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-20 06:08:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 143 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-07-20 06:08:11,950 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2022-07-20 06:08:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:11,950 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-07-20 06:08:11,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-07-20 06:08:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:08:11,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:11,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:11,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:12,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-20 06:08:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:12,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390150099] [2022-07-20 06:08:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:12,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:12,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:12,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 06:08:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:12,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:12,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:12,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:12,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:12,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:08:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:12,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:12,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:12,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390150099] [2022-07-20 06:08:12,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390150099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:12,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:12,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682564360] [2022-07-20 06:08:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:12,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:12,303 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:12,731 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2022-07-20 06:08:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:08:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:12,732 INFO L225 Difference]: With dead ends: 215 [2022-07-20 06:08:12,732 INFO L226 Difference]: Without dead ends: 215 [2022-07-20 06:08:12,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:12,733 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:12,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 656 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:08:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-20 06:08:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2022-07-20 06:08:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.5) internal successors, (156), 142 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-07-20 06:08:12,739 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2022-07-20 06:08:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:12,739 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-07-20 06:08:12,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-07-20 06:08:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:08:12,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:12,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:12,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:12,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,949 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-20 06:08:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:12,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382034512] [2022-07-20 06:08:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:12,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:12,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:12,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:12,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 06:08:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:13,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:08:13,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:13,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:13,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:13,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:13,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 06:08:13,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:13,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:13,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:13,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382034512] [2022-07-20 06:08:13,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382034512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:13,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:13,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704393884] [2022-07-20 06:08:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:13,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:13,114 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:13,649 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2022-07-20 06:08:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:13,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:08:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:13,650 INFO L225 Difference]: With dead ends: 207 [2022-07-20 06:08:13,651 INFO L226 Difference]: Without dead ends: 207 [2022-07-20 06:08:13,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:13,651 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 96 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:13,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:08:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-20 06:08:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2022-07-20 06:08:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-20 06:08:13,657 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-07-20 06:08:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:13,657 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-20 06:08:13,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-20 06:08:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:08:13,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:13,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:13,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:13,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:13,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2022-07-20 06:08:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:13,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004187884] [2022-07-20 06:08:13,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:13,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:13,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:13,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 06:08:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:13,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:13,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:13,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:13,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:13,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004187884] [2022-07-20 06:08:13,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004187884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:13,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:13,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026819038] [2022-07-20 06:08:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:13,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:13,937 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:13,960 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-20 06:08:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 06:08:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:13,962 INFO L225 Difference]: With dead ends: 185 [2022-07-20 06:08:13,962 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 06:08:13,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:13,963 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:13,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 06:08:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-20 06:08:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 144 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2022-07-20 06:08:13,969 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2022-07-20 06:08:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:13,969 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2022-07-20 06:08:13,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2022-07-20 06:08:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:08:13,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:13,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:13,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:14,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2022-07-20 06:08:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:14,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520947558] [2022-07-20 06:08:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:14,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:14,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:14,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:14,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 06:08:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:14,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:14,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:14,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:14,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:14,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520947558] [2022-07-20 06:08:14,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520947558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:14,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:14,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12823591] [2022-07-20 06:08:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:14,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:14,277 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:14,318 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-07-20 06:08:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:08:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:14,319 INFO L225 Difference]: With dead ends: 176 [2022-07-20 06:08:14,320 INFO L226 Difference]: Without dead ends: 176 [2022-07-20 06:08:14,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:14,322 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:14,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-20 06:08:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2022-07-20 06:08:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.396694214876033) internal successors, (169), 153 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-07-20 06:08:14,328 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2022-07-20 06:08:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:14,328 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-07-20 06:08:14,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-07-20 06:08:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:08:14,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:14,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:14,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:14,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:14,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2022-07-20 06:08:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422979828] [2022-07-20 06:08:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:14,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:14,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:14,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 06:08:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:14,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:14,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:14,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:14,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:08:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:14,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:14,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422979828] [2022-07-20 06:08:14,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422979828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:14,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:14,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:08:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162947117] [2022-07-20 06:08:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:14,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:14,690 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:14,892 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2022-07-20 06:08:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 06:08:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:14,893 INFO L225 Difference]: With dead ends: 152 [2022-07-20 06:08:14,893 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 06:08:14,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:14,894 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:14,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 06:08:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-20 06:08:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-07-20 06:08:14,898 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2022-07-20 06:08:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:14,898 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-07-20 06:08:14,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-07-20 06:08:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:08:14,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:14,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:14,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:15,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2022-07-20 06:08:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:15,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791000432] [2022-07-20 06:08:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:15,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:15,110 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:15,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 06:08:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:15,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:08:15,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:15,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:15,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791000432] [2022-07-20 06:08:15,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791000432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:15,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:15,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706322761] [2022-07-20 06:08:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:15,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:15,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:15,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:15,260 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 4.75) 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) [2022-07-20 06:08:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:15,424 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-20 06:08:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:15,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) 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 [2022-07-20 06:08:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:15,426 INFO L225 Difference]: With dead ends: 156 [2022-07-20 06:08:15,426 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 06:08:15,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:15,427 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:15,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 06:08:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-20 06:08:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-20 06:08:15,430 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2022-07-20 06:08:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:15,430 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-20 06:08:15,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) 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) [2022-07-20 06:08:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-20 06:08:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:08:15,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:15,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:15,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2022-07-20 06:08:15,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:15,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474483640] [2022-07-20 06:08:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:15,644 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:15,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 06:08:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:15,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:08:15,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:15,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:15,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:15,749 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:08:15,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:15,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:15,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:15,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:15,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:15,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:15,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:15,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474483640] [2022-07-20 06:08:15,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474483640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:15,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:15,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:15,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516819711] [2022-07-20 06:08:15,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:15,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:15,831 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:16,009 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-20 06:08:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:16,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 06:08:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:16,010 INFO L225 Difference]: With dead ends: 149 [2022-07-20 06:08:16,010 INFO L226 Difference]: Without dead ends: 149 [2022-07-20 06:08:16,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:16,011 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:16,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-20 06:08:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-20 06:08:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 145 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-20 06:08:16,015 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2022-07-20 06:08:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:16,015 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-20 06:08:16,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-20 06:08:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:08:16,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:16,017 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:16,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:16,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:16,225 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2022-07-20 06:08:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:16,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565193806] [2022-07-20 06:08:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:16,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:16,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:16,228 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:16,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 06:08:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:16,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:08:16,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:16,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:16,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:16,343 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:08:16,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:16,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:16,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:16,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:16,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:16,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:16,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:16,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565193806] [2022-07-20 06:08:16,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565193806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:16,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:16,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-20 06:08:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453333893] [2022-07-20 06:08:16,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:16,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:16,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:16,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:16,548 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:16,683 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-20 06:08:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:16,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:08:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:16,685 INFO L225 Difference]: With dead ends: 153 [2022-07-20 06:08:16,685 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 06:08:16,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:16,686 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:16,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 06:08:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-20 06:08:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 152 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-20 06:08:16,690 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2022-07-20 06:08:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:16,690 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-20 06:08:16,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-20 06:08:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:08:16,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:16,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:16,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:16,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:16,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2022-07-20 06:08:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:16,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314476300] [2022-07-20 06:08:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:16,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:16,902 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:16,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 06:08:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:16,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:16,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:17,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:17,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314476300] [2022-07-20 06:08:17,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314476300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:17,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:17,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-20 06:08:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151071464] [2022-07-20 06:08:17,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:17,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:17,180 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:17,447 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-20 06:08:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 06:08:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:17,449 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:08:17,449 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 06:08:17,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:17,450 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:17,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-20 06:08:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 06:08:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-20 06:08:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-07-20 06:08:17,453 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2022-07-20 06:08:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:17,454 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-07-20 06:08:17,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-07-20 06:08:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:08:17,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:17,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:17,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:17,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:17,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:17,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2022-07-20 06:08:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:17,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125816868] [2022-07-20 06:08:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:17,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:17,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:17,666 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:17,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 06:08:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:17,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:08:17,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:17,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:17,810 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:17,810 INFO L390 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 [2022-07-20 06:08:17,854 INFO L390 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 11 treesize of output 7 [2022-07-20 06:08:17,936 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:17,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 06:08:17,967 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:17,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:08:18,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 06:08:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:18,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:18,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-20 06:08:18,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-20 06:08:18,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-20 06:08:18,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:18,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-20 06:08:18,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:18,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-20 06:08:18,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-20 06:08:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:18,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:18,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125816868] [2022-07-20 06:08:18,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125816868] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:18,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:18,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-20 06:08:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63231141] [2022-07-20 06:08:18,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:18,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:08:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:18,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:08:18,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-07-20 06:08:18,368 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:19,170 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2022-07-20 06:08:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:08:19,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:08:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:19,172 INFO L225 Difference]: With dead ends: 238 [2022-07-20 06:08:19,172 INFO L226 Difference]: Without dead ends: 238 [2022-07-20 06:08:19,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2022-07-20 06:08:19,173 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:19,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 614 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 454 Unchecked, 0.6s Time] [2022-07-20 06:08:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-20 06:08:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2022-07-20 06:08:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 151 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-07-20 06:08:19,177 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2022-07-20 06:08:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:19,177 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-07-20 06:08:19,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-07-20 06:08:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:08:19,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:19,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:19,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:19,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:19,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2022-07-20 06:08:19,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:19,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785704432] [2022-07-20 06:08:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:19,382 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:19,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 06:08:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:19,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:19,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:19,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:19,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:19,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785704432] [2022-07-20 06:08:19,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785704432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:19,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:19,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555944967] [2022-07-20 06:08:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:19,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:19,500 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:19,529 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-07-20 06:08:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:08:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:19,531 INFO L225 Difference]: With dead ends: 209 [2022-07-20 06:08:19,531 INFO L226 Difference]: Without dead ends: 209 [2022-07-20 06:08:19,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:19,532 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:19,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 236 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-20 06:08:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2022-07-20 06:08:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 168 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-07-20 06:08:19,537 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2022-07-20 06:08:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:19,537 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-07-20 06:08:19,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-07-20 06:08:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:08:19,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:19,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:19,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:19,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:19,750 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2022-07-20 06:08:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307456162] [2022-07-20 06:08:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:19,753 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:19,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:08:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:19,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:08:19,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:19,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:19,929 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:08:19,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:08:19,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:20,070 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:20,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:08:20,109 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:20,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:08:20,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:08:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:20,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:20,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:08:20,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:08:20,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:08:20,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:20,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-20 06:08:20,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:20,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-20 06:08:20,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-20 06:08:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:37,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:37,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307456162] [2022-07-20 06:08:37,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307456162] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:37,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:37,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-20 06:08:37,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999536165] [2022-07-20 06:08:37,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:37,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:08:37,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:37,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:08:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=206, Unknown=5, NotChecked=96, Total=380 [2022-07-20 06:08:37,257 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:37,837 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-07-20 06:08:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:08:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 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 35 [2022-07-20 06:08:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:37,839 INFO L225 Difference]: With dead ends: 216 [2022-07-20 06:08:37,839 INFO L226 Difference]: Without dead ends: 216 [2022-07-20 06:08:37,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=118, Invalid=309, Unknown=5, NotChecked=120, Total=552 [2022-07-20 06:08:37,840 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 244 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:37,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 965 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 598 Unchecked, 0.4s Time] [2022-07-20 06:08:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-20 06:08:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2022-07-20 06:08:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 178 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2022-07-20 06:08:37,844 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2022-07-20 06:08:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:37,844 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2022-07-20 06:08:37,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-07-20 06:08:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:08:37,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:37,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:37,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:38,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:38,055 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2022-07-20 06:08:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:38,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113571790] [2022-07-20 06:08:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:38,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:38,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:38,058 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:38,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 06:08:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:38,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:08:38,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:38,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:38,218 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:38,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:38,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:38,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:38,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:38,380 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:38,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:08:38,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:38,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:08:38,423 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:38,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:08:38,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:08:38,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:08:38,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:38,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:38,982 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:08:39,048 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-20 06:08:39,086 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-20 06:08:39,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:39,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-07-20 06:08:39,131 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:39,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 06:08:39,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 06:08:39,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:39,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 06:08:39,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:39,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:08:39,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:39,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-20 06:08:39,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:39,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-20 06:08:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:39,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:39,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113571790] [2022-07-20 06:08:39,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113571790] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:39,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:39,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-20 06:08:39,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270929370] [2022-07-20 06:08:39,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:39,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 06:08:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 06:08:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-20 06:08:39,355 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:41,476 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2022-07-20 06:08:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:08:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 06:08:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:41,478 INFO L225 Difference]: With dead ends: 303 [2022-07-20 06:08:41,478 INFO L226 Difference]: Without dead ends: 303 [2022-07-20 06:08:41,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=610, Unknown=3, NotChecked=162, Total=930 [2022-07-20 06:08:41,480 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:41,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 636 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 711 Unchecked, 1.3s Time] [2022-07-20 06:08:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-20 06:08:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2022-07-20 06:08:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 182 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2022-07-20 06:08:41,485 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2022-07-20 06:08:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:41,485 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2022-07-20 06:08:41,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2022-07-20 06:08:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:08:41,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:41,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:41,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:41,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:41,691 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2022-07-20 06:08:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:41,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724703474] [2022-07-20 06:08:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:41,695 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:41,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 06:08:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:41,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:08:41,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:41,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:41,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:41,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:41,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:41,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:42,022 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:42,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-20 06:08:42,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:42,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 06:08:42,082 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:42,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-20 06:08:42,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-20 06:08:42,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-20 06:08:42,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-20 06:08:42,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-20 06:08:42,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:42,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:42,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2022-07-20 06:08:42,571 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:42,594 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.offset|)) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:42,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) is different from false [2022-07-20 06:08:42,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:42,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:08:42,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:42,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-20 06:08:42,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 06:08:42,672 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:08:42,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-07-20 06:08:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:42,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:42,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724703474] [2022-07-20 06:08:42,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724703474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:42,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:42,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-20 06:08:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693397382] [2022-07-20 06:08:42,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:42,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 06:08:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:42,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 06:08:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2022-07-20 06:08:42,810 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:44,555 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2022-07-20 06:08:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:08:44,555 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:08:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:44,556 INFO L225 Difference]: With dead ends: 301 [2022-07-20 06:08:44,557 INFO L226 Difference]: Without dead ends: 301 [2022-07-20 06:08:44,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=995, Unknown=3, NotChecked=204, Total=1406 [2022-07-20 06:08:44,558 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 403 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:44,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1301 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 857 Invalid, 0 Unknown, 523 Unchecked, 1.1s Time] [2022-07-20 06:08:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-20 06:08:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2022-07-20 06:08:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 181 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-07-20 06:08:44,563 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2022-07-20 06:08:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:44,564 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-07-20 06:08:44,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-07-20 06:08:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:08:44,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:44,565 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:44,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:44,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:44,775 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2022-07-20 06:08:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:44,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500607856] [2022-07-20 06:08:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:44,778 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:44,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 06:08:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:44,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:08:44,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:44,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:44,950 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:08:44,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:08:44,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:45,090 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:45,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:08:45,127 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:45,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:08:45,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:08:45,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-20 06:08:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:45,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:45,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:08:45,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv1 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:45,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:08:45,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:45,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:08:45,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:45,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-20 06:08:45,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-20 06:08:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:48,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:48,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500607856] [2022-07-20 06:08:48,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500607856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:48,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:48,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-20 06:08:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530948430] [2022-07-20 06:08:48,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:48,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 06:08:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 06:08:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=243, Unknown=4, NotChecked=102, Total=420 [2022-07-20 06:08:48,147 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:48,635 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-07-20 06:08:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:08:48,635 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:08:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:48,636 INFO L225 Difference]: With dead ends: 218 [2022-07-20 06:08:48,636 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 06:08:48,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=106, Invalid=322, Unknown=4, NotChecked=120, Total=552 [2022-07-20 06:08:48,637 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:48,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 686 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 887 Unchecked, 0.3s Time] [2022-07-20 06:08:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 06:08:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-07-20 06:08:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 201 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2022-07-20 06:08:48,642 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2022-07-20 06:08:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:48,642 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2022-07-20 06:08:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2022-07-20 06:08:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:08:48,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:48,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:48,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:48,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:48,854 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:48,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2022-07-20 06:08:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:48,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108281959] [2022-07-20 06:08:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:48,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:48,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:48,857 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:48,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 06:08:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:48,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 06:08:48,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:48,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:49,005 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:49,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:49,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:49,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:49,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:49,140 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:49,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 06:08:49,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:49,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:08:49,187 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:49,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:08:49,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:08:49,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:08:49,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:49,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:49,826 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:08:49,886 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:08:49,915 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 06:08:49,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:49,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 06:08:49,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:49,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:08:49,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:49,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2022-07-20 06:08:49,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:49,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2022-07-20 06:08:50,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-20 06:08:50,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-07-20 06:08:50,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:50,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2022-07-20 06:08:50,188 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:50,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-07-20 06:08:50,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:08:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:51,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:51,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108281959] [2022-07-20 06:08:51,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108281959] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:51,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:51,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-20 06:08:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437154564] [2022-07-20 06:08:51,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:51,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 06:08:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 06:08:51,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-20 06:08:51,898 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:53,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:53,411 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2022-07-20 06:08:53,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:08:53,412 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-20 06:08:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:53,413 INFO L225 Difference]: With dead ends: 217 [2022-07-20 06:08:53,413 INFO L226 Difference]: Without dead ends: 217 [2022-07-20 06:08:53,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2022-07-20 06:08:53,414 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:53,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 509 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 458 Invalid, 0 Unknown, 649 Unchecked, 0.9s Time] [2022-07-20 06:08:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-20 06:08:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-07-20 06:08:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 201 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2022-07-20 06:08:53,419 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2022-07-20 06:08:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:53,419 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2022-07-20 06:08:53,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-07-20 06:08:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:08:53,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:53,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:53,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-20 06:08:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:53,630 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:53,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2022-07-20 06:08:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:53,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460932416] [2022-07-20 06:08:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:53,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:53,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:53,633 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:53,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 06:08:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:53,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:08:53,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:53,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-20 06:08:53,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-20 06:08:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:08:53,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:08:53,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460932416] [2022-07-20 06:08:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460932416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:53,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:53,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-20 06:08:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959372402] [2022-07-20 06:08:53,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:53,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:53,886 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:54,094 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2022-07-20 06:08:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 06:08:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:54,098 INFO L225 Difference]: With dead ends: 229 [2022-07-20 06:08:54,098 INFO L226 Difference]: Without dead ends: 229 [2022-07-20 06:08:54,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:54,099 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:54,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-20 06:08:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2022-07-20 06:08:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.324607329842932) internal successors, (253), 222 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-07-20 06:08:54,103 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2022-07-20 06:08:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:54,104 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-07-20 06:08:54,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-07-20 06:08:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:08:54,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:54,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:54,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:54,315 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2022-07-20 06:08:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:54,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743414588] [2022-07-20 06:08:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:54,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:54,318 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:54,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 06:08:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:54,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 06:08:54,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 06:08:54,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:54,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743414588] [2022-07-20 06:08:54,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743414588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:54,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:54,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026856878] [2022-07-20 06:08:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:54,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:54,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:54,456 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:54,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:54,486 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-20 06:08:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:54,486 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 41 [2022-07-20 06:08:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:54,487 INFO L225 Difference]: With dead ends: 283 [2022-07-20 06:08:54,487 INFO L226 Difference]: Without dead ends: 283 [2022-07-20 06:08:54,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:54,488 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:54,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-20 06:08:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2022-07-20 06:08:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 240 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2022-07-20 06:08:54,493 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2022-07-20 06:08:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:54,493 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2022-07-20 06:08:54,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-07-20 06:08:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:08:54,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:54,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:54,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:54,710 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:54,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2022-07-20 06:08:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:54,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809291618] [2022-07-20 06:08:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:54,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:54,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:54,712 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:54,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 06:08:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:54,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:08:54,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:54,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:54,854 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:54,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:54,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:54,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:54,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:08:54,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:08:54,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:08:55,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:08:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:55,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:55,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:08:55,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:08:55,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:08:55,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:55,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:08:55,151 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:55,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-20 06:08:55,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 06:08:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:55,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:55,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809291618] [2022-07-20 06:08:55,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809291618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:55,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:55,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-20 06:08:55,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852359408] [2022-07-20 06:08:55,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:55,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 06:08:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:55,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 06:08:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2022-07-20 06:08:55,226 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:56,095 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2022-07-20 06:08:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:08:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:08:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:56,097 INFO L225 Difference]: With dead ends: 258 [2022-07-20 06:08:56,097 INFO L226 Difference]: Without dead ends: 258 [2022-07-20 06:08:56,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=493, Unknown=3, NotChecked=150, Total=812 [2022-07-20 06:08:56,099 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:56,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 899 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 547 Invalid, 0 Unknown, 451 Unchecked, 0.6s Time] [2022-07-20 06:08:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-20 06:08:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2022-07-20 06:08:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 242 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2022-07-20 06:08:56,105 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2022-07-20 06:08:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:56,105 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2022-07-20 06:08:56,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-07-20 06:08:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:08:56,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:56,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:56,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:56,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:56,316 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1471647316, now seen corresponding path program 1 times [2022-07-20 06:08:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:56,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034567139] [2022-07-20 06:08:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:56,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:56,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:56,318 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:56,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 06:08:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:56,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:56,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:56,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:56,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034567139] [2022-07-20 06:08:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034567139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:56,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:56,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582282209] [2022-07-20 06:08:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:56,447 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:56,487 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2022-07-20 06:08:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:08:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:56,489 INFO L225 Difference]: With dead ends: 256 [2022-07-20 06:08:56,489 INFO L226 Difference]: Without dead ends: 256 [2022-07-20 06:08:56,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:56,490 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:56,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-20 06:08:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2022-07-20 06:08:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.273170731707317) internal successors, (261), 236 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-07-20 06:08:56,501 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 42 [2022-07-20 06:08:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:56,502 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-07-20 06:08:56,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-07-20 06:08:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:08:56,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:56,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:56,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:56,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:56,713 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1095816814, now seen corresponding path program 1 times [2022-07-20 06:08:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446776411] [2022-07-20 06:08:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:56,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:56,715 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:56,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 06:08:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:56,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:08:56,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:56,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:56,890 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:56,891 INFO L390 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 [2022-07-20 06:08:56,924 INFO L390 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 11 treesize of output 7 [2022-07-20 06:08:57,029 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:57,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 06:08:57,066 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:57,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 06:08:57,123 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:57,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:57,164 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:08:57,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-20 06:08:57,321 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:08:57,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-20 06:08:57,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 06:08:57,444 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:08:57,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-20 06:08:57,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-20 06:08:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:57,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:57,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-20 06:08:57,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-20 06:08:57,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:57,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-20 06:08:57,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_28| (_ BitVec 32))) (or (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_28| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|))))) is different from false [2022-07-20 06:08:57,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:57,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:08:57,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-20 06:08:57,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-20 06:08:57,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.offset_75| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |v_ULTIMATE.start_main_~item~0#1.offset_75|))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2022-07-20 06:08:57,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:57,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 06:08:57,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:57,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 76 [2022-07-20 06:08:57,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:57,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2022-07-20 06:08:57,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-20 06:08:57,832 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:57,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:08:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-20 06:08:57,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446776411] [2022-07-20 06:08:57,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446776411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:57,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-07-20 06:08:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569081591] [2022-07-20 06:08:57,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:57,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 06:08:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 06:08:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=247, Unknown=8, NotChecked=312, Total=650 [2022-07-20 06:08:57,976 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:58,939 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2022-07-20 06:08:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:08:58,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:08:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:58,941 INFO L225 Difference]: With dead ends: 294 [2022-07-20 06:08:58,941 INFO L226 Difference]: Without dead ends: 294 [2022-07-20 06:08:58,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=604, Unknown=8, NotChecked=472, Total=1260 [2022-07-20 06:08:58,942 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 237 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1601 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:58,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 929 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 428 Invalid, 0 Unknown, 1601 Unchecked, 0.5s Time] [2022-07-20 06:08:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-20 06:08:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 259. [2022-07-20 06:08:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 227 states have (on average 1.251101321585903) internal successors, (284), 258 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) [2022-07-20 06:08:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2022-07-20 06:08:58,947 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 42 [2022-07-20 06:08:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:58,947 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2022-07-20 06:08:58,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2022-07-20 06:08:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 06:08:58,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:58,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:58,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:59,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:08:59,159 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:08:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1865620530, now seen corresponding path program 1 times [2022-07-20 06:08:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:59,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662300388] [2022-07-20 06:08:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:59,161 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:08:59,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 06:08:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:59,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:08:59,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:59,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:59,348 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:59,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:59,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:08:59,463 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:59,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-07-20 06:08:59,487 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:59,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:08:59,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-20 06:08:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:59,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:59,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_805 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:08:59,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:59,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-20 06:08:59,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:59,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-20 06:08:59,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 06:09:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:01,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662300388] [2022-07-20 06:09:01,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662300388] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:01,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:01,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-20 06:09:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646860115] [2022-07-20 06:09:01,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 06:09:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 06:09:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=212, Unknown=16, NotChecked=30, Total=306 [2022-07-20 06:09:01,963 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:03,031 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2022-07-20 06:09:03,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:09:03,032 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-20 06:09:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:03,033 INFO L225 Difference]: With dead ends: 266 [2022-07-20 06:09:03,033 INFO L226 Difference]: Without dead ends: 266 [2022-07-20 06:09:03,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=225, Invalid=744, Unknown=27, NotChecked=60, Total=1056 [2022-07-20 06:09:03,034 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 281 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:03,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 792 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 417 Invalid, 0 Unknown, 355 Unchecked, 0.5s Time] [2022-07-20 06:09:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-20 06:09:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2022-07-20 06:09:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.25) internal successors, (285), 259 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2022-07-20 06:09:03,038 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 43 [2022-07-20 06:09:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:03,039 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2022-07-20 06:09:03,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2022-07-20 06:09:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:09:03,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:03,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:03,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:03,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:03,250 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:09:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1999661141, now seen corresponding path program 1 times [2022-07-20 06:09:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:03,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641940740] [2022-07-20 06:09:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:03,252 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:03,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 06:09:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:03,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:09:03,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:09:03,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:03,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:03,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641940740] [2022-07-20 06:09:03,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641940740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:03,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:03,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:09:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718012815] [2022-07-20 06:09:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:03,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:09:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:09:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:09:03,370 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:03,594 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2022-07-20 06:09:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:09:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:09:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:03,595 INFO L225 Difference]: With dead ends: 260 [2022-07-20 06:09:03,595 INFO L226 Difference]: Without dead ends: 260 [2022-07-20 06:09:03,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:09:03,596 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:03,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 172 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-20 06:09:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2022-07-20 06:09:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 252 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2022-07-20 06:09:03,604 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 44 [2022-07-20 06:09:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:03,605 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2022-07-20 06:09:03,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2022-07-20 06:09:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:09:03,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:03,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:03,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:03,816 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-20 06:09:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -433899271, now seen corresponding path program 1 times [2022-07-20 06:09:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:03,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067245701] [2022-07-20 06:09:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:03,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:03,818 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:03,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 06:09:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:03,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:09:03,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:03,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:03,992 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:03,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:09:04,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:09:04,116 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:09:04,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-20 06:09:04,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 06:09:04,220 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-20 06:09:04,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-20 06:09:04,238 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-20 06:09:04,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-20 06:09:04,597 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 06:09:04,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-20 06:09:04,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-20 06:09:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:04,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:16,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:16,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2809 treesize of output 1959